- Tytuł:
- 2-factors in claw-free graphs
- Autorzy:
-
Chen, Guantao
Faudree, Jill
Gould, Ronald
Saito, Akira - Powiązania:
- https://bibliotekanauki.pl/articles/743756.pdf
- Data publikacji:
- 2000
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
claw-free
forbidden subgraphs
2-factors
cycles - Opis:
- We consider the question of the range of the number of cycles possible in a 2-factor of a 2-connected claw-free graph with sufficiently high minimum degree. (By claw-free we mean the graph has no induced $K_{1,3}$.) In particular, we show that for such a graph G of order n ≥ 51 with δ(G) ≥ (n-2)/3, G contains a 2-factor with exactly k cycles, for 1 ≤ k ≤ (n-24)/3. We also show that this result is sharp in the sense that if we lower δ(G), we cannot obtain the full range of values for k.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2000, 20, 2; 165-172
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł