Polychromatic colorings of plane graphs
From MaRDI portal
Publication:5896961
DOI10.1007/s00454-009-9171-5zbMath1214.05021OpenAlexW4241626594WikidataQ56475784 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
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (12)
Polychromatic colorings of hypergraphs with high balance ⋮ Cyclic 4-Colorings of Graphs on Surfaces ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Box-respecting colorings of \(n\)-dimensional guillotine-partitions ⋮ Facial achromatic number of triangulations on the sphere ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications ⋮ Facial visibility in edge colored plane graphs ⋮ Balanced polychromatic 2-coloring of triangulations ⋮ Extension to 3-Colorable Triangulations ⋮ Polychromatic colorings of arbitrary rectangular partitions ⋮ Chords of 2-factors in planar cubic bridgeless graphs ⋮ A note on polychromatic colorings of plane graphs
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
This page was built for publication: Polychromatic colorings of plane graphs
