Closure, 2-factors, and cycle coverings in claw-free graphs

Kód výsledku v 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>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Closure, 2-factors, and cycle coverings in claw-free graphs
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
Closure, 2-factors, and cycle coverings in claw-free graphs
Popis výsledku anglicky
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.

Druh
J<sub>x</sub> - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
CEP obor
BA - Obecná matematika
OECD FORD obor
—

Rok uplatnění
1999
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)