Circumferences of 2-factors in claw-free graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F13%3A43919733" target="_blank" >RIV/49777513:23520/13:43919733 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S0012365X12003676#" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0012365X12003676#</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2012.08.005" target="_blank" >10.1016/j.disc.2012.08.005</a>
Alternative languages
Result language
angličtina
Original language name
Circumferences of 2-factors in claw-free graphs
Original language description
The main result of the paper says that in every 2-connected claw-free graph there is a 2-factor such that the lenght of the longest cycle in it is at least 2d+4, where d is the minimum degree of the graph. This is proved for d at least 7.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
DISCRETE MATHEMATICS
ISSN
0012-365X
e-ISSN
—
Volume of the periodical
313
Issue of the periodical within the volume
19
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
10
Pages from-to
1934-1943
UT code for WoS article
000322689800015
EID of the result in the Scopus database
—