- Tytuł:
- On traceability and 2-factors in claw-free graphs
- Autorzy:
-
Fronček, Dalibor
Ryjáček, Zdeněk
Skupień, Zdzisław - Powiązania:
- https://bibliotekanauki.pl/articles/744410.pdf
- Data publikacji:
- 2004
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
traceability
2-factor
claw
degree condition
closure - Opis:
- If G is a claw-free graph of sufficiently large order n, satisfying a degree condition σₖ > n + k² - 4k + 7 (where k is an arbitrary constant), then G has a 2-factor with at most k - 1 components. As a second main result, we present classes of graphs ₁,...,₈ such that every sufficiently large connected claw-free graph satisfying degree condition σ₆(k) > n + 19 (or, as a corollary, δ(G) > (n+19)/6) either belongs to $⋃ ⁸_{i=1} _i$ or is traceable.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2004, 24, 1; 55-71
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł