An Analogue to the Heawood Map-Colouring Problem

DOI10.1112/JLMS/S2-1.1.750MaRDI QIDQ5576239zbMATH OpenOpenAlexFDO

Authors H. V. Kronk

Publication date 1969

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-1.1.750

zbMATH Keywords

topology

Cited in

(12)

• Some results in topological graph theory
• A structural property of trees with an application to vertex-arboricity
• Acyclic colorings of planar graphs
• List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
• Vertex arboricity of toroidal graphs with a forbidden cycle
• A note on the list vertex arboricity of toroidal graphs
• Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles
• Coloring face-hypergraphs of graphs on surfaces
• Graph theory
• Point Partition Numbers and Girth
• On the dichromatic number of surfaces
• On the vertex-arboricity of planar graphs

This page was built for publication: An Analogue to the Heawood Map-Colouring Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5576239)