Polychromatic colorings of bounded degree plane graphs

DOI10.1002/jgt.20357zbMath1198.05054MaRDI QIDQ3633009

Roi Krakovski, Elad Aigner-Horev

Publication date: 16 June 2009

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

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

zbMATH Keywords

bounded degree graphs; plane graphs; vertex coloring with constraints on the faces

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

Extension to 3-Colorable Triangulations, Polychromatic colorings of plane graphs, Polychromatic 4-coloring of cubic even embeddings on the projective plane, Polychromatic 4-coloring of cubic bipartite plane graphs, Box-respecting colorings of \(n\)-dimensional guillotine-partitions, Polychromatic 4-coloring of guillotine subdivisions, Polychromatic colorings of rectangular partitions, Polychromatic colorings of arbitrary rectangular partitions, Facial achromatic number of triangulations on the sphere, Facially-constrained colorings of plane graphs: a survey

Cites Work

• Unnamed Item
• Polychromatic colorings of rectangular partitions
• The Grötzsch theorem for the hypergraph of maximal cliques
• Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
• GUARDING RECTANGULAR PARTITIONS
• A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
• Polychromatic colorings of plane graphs