A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
From MaRDI portal
Publication:4881287
DOI10.1137/S0895480194265611zbMath0852.05049OpenAlexW2071826698MaRDI QIDQ4881287
Publication date: 25 November 1996
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480194265611
Related Items (13)
Extension to Even Triangulations ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Polychromatic 4-coloring of cubic bipartite plane graphs ⋮ On Some City Guarding Problems ⋮ Polychromatic colorings of plane graphs ⋮ Polychromatic 4-coloring of guillotine subdivisions ⋮ New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision ⋮ Polychromatic colorings of bounded degree plane graphs ⋮ Balanced polychromatic 2-coloring of triangulations ⋮ Extension to 3-Colorable Triangulations ⋮ Polychromatic colorings of rectangular partitions ⋮ Euler Transformation of Polyhedral Complexes ⋮ How to guard orthogonal polygons: diagonal graphs and vertex covers
This page was built for publication: A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
