On \(q\)-power cycles in cubic graphs

DOI10.7151/dmgt.1926zbMath1400.05128OpenAlexW2571066894MaRDI QIDQ503679

Julien Bensmail

Publication date: 23 January 2017

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

Full work available at URL: https://doi.org/10.7151/dmgt.1926

zbMATH Keywords

cubic graphs\(q\)-power cyclesErdős-Gyárfás conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (3)

Minimal unavoidable sets of cycles in plane graphs ⋮ On 2-power unicyclic cubic graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some old and new problems in various branches of combinatorics
• Erdős-Gyárfás conjecture for cubic planar graphs
• On the Erdős-Gyárfás conjecture in claw-free graphs

This page was built for publication: On \(q\)-power cycles in cubic graphs