On the chromatic number of the visibility graph of a set of points in the plane
From MaRDI portal
Publication:2572584
DOI10.1007/s00454-005-1177-zzbMath1074.05036OpenAlexW2170459217MaRDI QIDQ2572584
Jan Kára, David R. Wood, Attila Pór
Publication date: 10 November 2005
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-005-1177-z
Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (15)
Blocking visibility for points in general position ⋮ Coloring polygon visibility graphs and their generalizations ⋮ On colourability of polygon visibility graphs ⋮ Edge colorings avoiding patterns ⋮ Preface: CALDAM 2017 ⋮ On colouring point visibility graphs ⋮ Computational complexity aspects of point visibility graphs ⋮ Every large point set contains many collinear points or an empty pentagon ⋮ Compact Grid Representation of Graphs ⋮ Recognition and complexity of point visibility graphs ⋮ On the connectivity of visibility graphs ⋮ On Colourability of Polygon Visibility Graphs ⋮ Point Visibility Graph Recognition is NP-Hard ⋮ Visibility graphs of point sets in the plane ⋮ Some results on point visibility graphs
This page was built for publication: On the chromatic number of the visibility graph of a set of points in the plane
