Hajós' conjecture and cycle power graphs

DOI10.1016/j.ejc.2009.08.008zbMath1221.05148OpenAlexW2086681947WikidataQ123333929 ScholiaQ123333929MaRDI QIDQ966132

Yumei Peng, Deming Li, Ming Ju Liu

Publication date: 27 April 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.08.008

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Spanning trees in directed circulant graphs and cycle power graphs

Cites Work

• Unnamed Item
• Some remarks on Hajós' conjecture
• Hajós' conjecture for line graphs
• Hajos' graph-coloring conjecture: Variations and counterexamples
• Topological minors in graphs of large girth
• On the conjecture of Hajos
• Reducing Hajós' 4-coloring conjecture to 4-connected graphs
• Improved Bounds for Topological Cliques in Graphs of Large Girth
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Triangulations and the Hajós conjecture
• Triangulations and the Hajós conjecture

This page was built for publication: Hajós' conjecture and cycle power graphs