Polychromatic colorings of bounded degree plane graphs
From MaRDI portal
Publication:3633009
Recommendations
Cites work
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
- GUARDING RECTANGULAR PARTITIONS
- 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
Cited in
(17)- Box-respecting colorings of \(n\)-dimensional guillotine-partitions
- On maximal cycles or triangular planar polygonal graphs and their coloring
- Polychromatic colorings of arbitrary rectangular partitions
- Polychromatic colorings of plane graphs
- Extension to 3-colorable triangulations
- Colouring planar graphs with three colours and no large monochromatic components
- Polychromatic 4-coloring of guillotine subdivisions
- An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
- Polychromatic colorings of rectangular partitions
- 3-polychromatic quadrangulations on surfaces
- On maximum face-constrained coloring of plane graphs with no short face cycles.
- Facially-constrained colorings of plane graphs: a survey
- A note on polychromatic colorings of plane graphs
- Polychromatic 4-coloring of cubic bipartite plane graphs
- Balanced polychromatic 2-coloring of triangulations
- Facial achromatic number of triangulations on the sphere
- 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)