Cyclic 4-Colorings of Graphs on Surfaces

DOI10.1002/jgt.21900zbMath1342.05048OpenAlexW1926559266MaRDI QIDQ3188662

Kenta Noguchi, Atsuhiro Nakamoto, Kenta Ozeki

Publication date: 12 August 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21900

zbMATH Keywords

four color theorem3-edge-coloringscyclic 4-colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Extension to Even Triangulations ⋮ Generating even triangulations on the torus ⋮ Extension to 3-Colorable Triangulations ⋮ 1-Planar Graphs ⋮ A note on the upper bounds on the size of bipartite and tripartite 1-embeddable graphs on surfaces

Cites Work

• Unnamed Item
• Polychromatic 4-coloring of cubic bipartite plane graphs
• Another step towards proving a conjecture by Plummer and Toft
• Cyclic coloring of plane graphs
• Five-coloring maps on surfaces
• The four-colour theorem
• A new bound on the cyclic chromatic number
• Cyclic Chromatic Number of 3-Connected Plane Graphs
• Circuit Double Cover of Graphs
• Re-embeddings of Maximum 1-Planar Graphs
• Full 4-colorings of 4-regular maps
• Polyhedral embeddings of snarks in orientable surfaces
• Every planar map is four colorable
• A new proof of the 6 color theorem
• Coloring-flow duality of embedded graphs
• Polychromatic colorings of plane graphs
• Circular chromatic number: A survey

This page was built for publication: Cyclic 4-Colorings of Graphs on Surfaces