Polychromatic colorings of plane graphs

DOI10.1007/s00454-009-9171-5zbMath1214.05021WikidataQ56475784 ScholiaQ56475784MaRDI QIDQ5896961

Noga Alon, Péter Csorba, Philipp Zumstein, Robert Berke, Kevin Buchin, Saswata Shannigrahi, Bettina Speckmann, Maike Buchin

Publication date: 27 August 2009

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-009-9171-5

zbMATH Keywords

graph coloring; planar graphs; guarding problems

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, Box-respecting colorings of \(n\)-dimensional guillotine-partitions, Polychromatic colorings of arbitrary rectangular partitions, Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications, Facial achromatic number of triangulations on the sphere, Facially-constrained colorings of plane graphs: a survey, Cyclic 4-Colorings of Graphs on Surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polychromatic 4-coloring of cubic bipartite plane graphs
• Guarding polyhedral terrains
• Problems and results in extremal combinatorics. II
• Polychromatic colorings of rectangular partitions
• Matching theory
• The Grötzsch theorem for the hypergraph of maximal cliques
• Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
• GUARDING RECTANGULAR PARTITIONS
• Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon
• Polychromatic Colorings of n-Dimensional Guillotine-Partitions
• Polychromatic Colorings of Subcubes of the Hypercube
• Polychromatic colorings of bounded degree plane graphs
• A generalization of edge-coloring in graphs
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems