Polychromatic colorings of bounded degree plane graphs
From MaRDI portal
Publication:3633009
DOI10.1002/JGT.20357zbMATH Open1198.05054OpenAlexW4246652748MaRDI QIDQ3633009FDOQ3633009
Authors: Elad Aigner-Horev, Roi Krakovski 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
- Polychromatic colorings of plane graphs
- 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
Cited In (14)
- Box-respecting colorings of \(n\)-dimensional guillotine-partitions
- Polychromatic colorings of arbitrary rectangular partitions
- Polychromatic colorings of plane graphs
- An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
- Polychromatic 4-coloring of guillotine subdivisions
- Polychromatic colorings of rectangular partitions
- On maximum face-constrained coloring of plane graphs with no short face cycles.
- A note on polychromatic colorings of plane graphs
- Facially-constrained colorings of plane graphs: a survey
- Polychromatic 4-coloring of cubic bipartite plane graphs
- Balanced polychromatic 2-coloring of triangulations
- Facial achromatic number of triangulations on the sphere
- Extension to 3-Colorable Triangulations
- Polychromatic 4-coloring of cubic even embeddings on the projective plane
This page was built for publication: Polychromatic colorings of bounded degree plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3633009)
