A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
From MaRDI portal
Publication:4881287
DOI10.1137/S0895480194265611zbMath0852.05049MaRDI QIDQ4881287
Publication date: 25 November 1996
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
05C15: Coloring of graphs and hypergraphs
Related Items
Extension to 3-Colorable Triangulations, Polychromatic colorings of plane graphs, How to guard orthogonal polygons: diagonal graphs and vertex covers, Polychromatic 4-coloring of cubic bipartite plane graphs, Polychromatic 4-coloring of guillotine subdivisions, Polychromatic colorings of rectangular partitions, Facially-constrained colorings of plane graphs: a survey, Extension to Even Triangulations, On Some City Guarding Problems, Polychromatic colorings of bounded degree plane graphs