Closure, 2-factors, and cycle coverings 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%2F99%3A00043067" target="_blank" >RIV/49777513:23520/99:00043067 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Closure, 2-factors, and cycle coverings in claw-free graphs
Original language description
In this paper we study cycle coverings and 2-factors of a claw-free graph and those of its closure, which has been defined by the first author (On a closure concept in claw-free graphs, J. Combinatorial Theory Ser. B 70 (1997), 217-224). For a claw-freeraph G and its closure cl(G), we prove (1) V(G) is covered by k cycles in G if and only if V(cl(G)) is covered by k cycles of cl(G), and (2) G has a 2-factor with at most k components if and only if cl(G) has a 2-factor with at most k components.
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
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
1999
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
Closure, 2-factors, and cycle coverings in claw-free graphs
ISSN
03649024
e-ISSN
—
Volume of the periodical
Vol.^32
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
9
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—