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.05036MaRDI 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
05C15: Coloring of graphs and hypergraphs
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Compact Grid Representation of Graphs, On Colourability of Polygon Visibility Graphs, Visibility graphs of point sets in the plane, Coloring polygon visibility graphs and their generalizations, Recognition and complexity of point visibility graphs, Every large point set contains many collinear points or an empty pentagon, On the connectivity of visibility graphs, Computational complexity aspects of point visibility graphs, Preface: CALDAM 2017, On colouring point visibility graphs, Some results on point visibility graphs, Blocking visibility for points in general position, Point Visibility Graph Recognition is NP-Hard