Erdős-Gyárfás conjecture for cubic planar graphs

zbMath1267.05152MaRDI QIDQ1953482

Christopher Carl Heckman, Roi Krakovski

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p7

zbMATH Keywords

cubic planar graphscycles of prescribed lengthsErdős-gyárfás conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (7)

Minimal unavoidable sets of cycles in plane graphs ⋮ On 2-power unicyclic cubic graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Erdős-Gyárfás conjecture for some families of Cayley graphs ⋮ On \(q\)-power cycles in cubic graphs ⋮ Erdős-Gyárfás conjecture for \(P_8\)-free graphs

Cites Work

• Unnamed Item
• Some old and new problems in various branches of combinatorics

This page was built for publication: Erdős-Gyárfás conjecture for cubic planar graphs