On Visibility Graphs of Point Sets in the Plane

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4 pages

Scientific paper

The visibility graph Vis(X) of a discrete point set X in the plane has vertex set X and an edge xy for every two points x,y\in X whenever there is no other point in X on the line segment between x and y. We show that for every graph G, there is a point set X, such that the subgraph of Vis(X\cup Z^2) induced by X is isomorphic to G. As a consequence, we show that there are visibility graphs of arbitrary high chromatic number with clique number six settling a question by K\'{a}ra, P\'{o}r and Wood.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On Visibility Graphs of Point Sets in the Plane does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Visibility Graphs of Point Sets in the Plane, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Visibility Graphs of Point Sets in the Plane will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-89547

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.