Minimum Degree and Disjoint Cycles in Claw-Free Graphs

DOI10.1017/S0963548311000708zbMath1241.05094MaRDI QIDQ2883856

Ronald J. Gould, Ralph J. Faudree, Michael S. Jacobson

Publication date: 14 May 2012

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

disjoint cycles in claw-free graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

A note on powers of Hamilton cycles in generalized claw-free graphs ⋮ Extremal colorings and independent sets ⋮ Disjoint cycles with partial degree conditions in claw-free graphs

Cites Work

• Vertex-disjoint triangles in claw-free graphs with minimum degree at least three
• 2-factors in claw-free graphs
• On the maximal number of independent circuits in a graph
• Asymptotic upper bounds for Ramsey functions

This page was built for publication: Minimum Degree and Disjoint Cycles in Claw-Free Graphs