On the Erdős-Gyárfás conjecture in claw-free graphs

DOI10.7151/dmgt.1732zbMath1295.05135arXiv1109.5398OpenAlexW2592983029WikidataQ123152183 ScholiaQ123152183MaRDI QIDQ2509554

Pouria Salehi Nowbandegani, Mohammad Hassan Shirdareh Haghighi, Hossein Esfandiari, Khodakhast Bibak

Publication date: 28 July 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.5398

zbMATH Keywords

cyclesclaw-free graphsErdős-Gyárfás conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Vertex degrees (05C07)

Related Items (4)

Unnamed Item ⋮ Unnamed Item ⋮ On \(q\)-power cycles in cubic graphs ⋮ Erdős-Gyárfás conjecture for \(P_8\)-free graphs

Cites Work

• Some old and new problems in various branches of combinatorics
• Unavoidable cycle lengths in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Erdős-Gyárfás conjecture in claw-free graphs