An acyclic analogue to Heawood's theorem

DOI10.1017/S001708950000358XzbMath0378.05030MaRDI QIDQ4156455

Michael O. Albertson, David M. Berman

Publication date: 1978

Published in: Glasgow Mathematical Journal (Search for Journal in Brave)

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

On acyclic colorings of graphs on surfaces ⋮ Hardness transitions and uniqueness of acyclic colouring ⋮ Adjacency posets of planar graphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ A bound for the game chromatic number of graphs ⋮ The game coloring number of planar graphs

Cites Work

• Every planar graph has an acyclic 7-coloring
• Every planar graph has an acyclic 8-coloring
• Acyclic colorings of planar graphs

This page was built for publication: An acyclic analogue to Heawood's theorem