Minimum Degree and Disjoint Cycles in Claw-Free Graphs

Autor:	Ralph J. Faudree, Michael S. Jacobson, Ronald J. Gould
Rok vydání:	2012
Předmět:	Statistics and Probability Discrete mathematics Claw Clique-sum Applied Mathematics Induced subgraph Disjoint sets Graph Theoretical Computer Science Combinatorics Computational Theory and Mathematics Chordal graph Cograph Mathematics
Zdroj:	Combinatorics, Probability and Computing. 21:129-139
ISSN:	1469-2163 0963-5483
Popis:	A graph is claw-free if it does not contain an induced subgraph isomorphic to K1,3. Cycles in claw-free graphs have been well studied. In this paper we extend results on disjoint cycles in claw-free graphs satisfying certain minimum degree conditions. In particular, we prove that if G is claw-free of sufficiently large order n = 3k with δ(G) ≥ n/2, then G contains k disjoint triangles.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::9ec0996b5fa5ea8c5c699bbca993b2e6 https://doi.org/10.1017/s0963548311000708 Zobrazit plný text záznamu