Short cycle covers of graphs with minimum degree three

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F10%3A00503290" target="_blank" >RIV/49777513:23520/10:00503290 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Short cycle covers of graphs with minimum degree three

Original language description

The shortest cycle cover conjecture of Alon and Tarsi asserts that the edges of every bridgeless graph with m edges can be covered by cycles of total length at most 7m/5 = 1.400m. We show that every cubic bridgeless graph has a cycle cover of total length at most 34m/21, which is about 1.619m, and every bridgeless graph with minimum degree three has a cycle cover of total length at most 44m/27, which is about 1.630m.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2010

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

SIAM Journal of Discrete Mathematics

ISSN

0895-4801

e-ISSN

—

Volume of the periodical

24

Issue of the periodical within the volume

1

Country of publishing house

US - UNITED STATES

Number of pages

26

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—