2-factors with bounded number of components in claw-free graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F15%3A43924144" target="_blank" >RIV/49777513:23520/15:43924144 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.disc.2014.12.017" target="_blank" >http://dx.doi.org/10.1016/j.disc.2014.12.017</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2014.12.017" target="_blank" >10.1016/j.disc.2014.12.017</a>

Result language
angličtina
Original language name
2-factors with bounded number of components in claw-free graphs
Original language description
In this paper, we give an upper bound on the number of cycles in a 2-factor in a 3-connected claw-free graph G in terms of the independence number of G. As a corollary, we also prove an analogous bound in terms of the minimum degree of G. The results extend a known result on the number of cycles of a 2-factor in 3-connected claw-free graphs.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

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)

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

Similar results(10)