Polychromatic 4-coloring of cubic even embeddings on the projective plane

DOI10.1016/j.disc.2013.07.005zbMath1279.05027MaRDI QIDQ389458

Atsuhiro Nakamoto, Momoko Kobayashi, Tsubasa Yamaguchi

Publication date: 20 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.07.005

zbMATH Keywords

projective plane; Möbius ladder; even embedding; Eulerian triangulation; polychromatic coloring

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

Extension to 3-Colorable Triangulations, Generating 4-connected even triangulations on the sphere, Generating even triangulations on the torus, A generating theorem of simple even triangulations with a finitizable set of reductions, Balanced polychromatic 2-coloring of triangulations, Facial achromatic number of triangulations on the sphere, Generating even triangulations on the Klein bottle

Cites Work

• Unnamed Item
• Polychromatic 4-coloring of cubic bipartite plane graphs
• Inductive definition of two restricted classes of triangulations
• A short proof of Chvatal's Watchman Theorem
• Coloring Eulerian triangulations of the projective plane
• A combinatorial theorem in plane geometry
• Generation of simple quadrangulations of the sphere
• Polychromatic colorings of bounded degree plane graphs
• Generating all planer graphs regular of degree four
• Generating all 4-regular planar graphs from the graph of the octahedron
• Generating quadrangulations of surfaces with minimum degree at least 3
• Generating all 3‐connected 4‐regular planar graphs from the octahedron graph
• Generating even triangulations of the projective plane
• Polychromatic colorings of plane graphs