Two Results on Intersection Graphs of Polygons
Intersection graphs of convex polygons inscribed to a circle, so called polygon-circle graphs, generalize several well studied classes of graphs, e.g., interval graphs, circle graphs, circular-arc graphs and chordal graphs. We consider the question how complicated need to be the polygons in a polygon-circle representation of a graph.
Let cmp (n) denote the minimum k such that every polygon-circle graph on n vertices is the intersection graph of k-gons inscribed to the circle. We prove that cmp(n) = n − log 2 n + o(log 2 n) by showing that for every positive constant c < 1,cmp(n) ≤ n − clogn for every sufficiently large n, and by providing an explicit construction of polygon-circle graphs on n vertices which are not representable by polygons with less than n − logn − 2 loglogn corners. We also show that recognizing intersection graphs of k-gons inscribed in a circle is an NP-complete problem for every fixed k ≥ 3.
- 2.Eschen, E.M., Spinrad, J.P.: An O(n 2) algorithm for circular-arc graph recognition. In: Proceedings 4th ACM-SIAM Symposium on Discrete Algorithms, pp. 128–137 (1993)Google Scholar
- 3.de Frayssiex, H.: A characterization of circle graphs. Eur. J. Comb. 5, 223–238 (1984)Google Scholar
- 7.Koebe, M.: On a New Class of Intersection Graphs. In: Proceedings of the Fourth Czechoslovak Symposium on Combinatorics Prachatice, pp. 141–143 (1990)Google Scholar
- 14.Spinrad, J.P.: http://www.vuse.vanderbilt.edu/~spin/open.html
- 15.Schaefer, M., Stefankovič, D.: Decidability of string graphs. In: STOC 2001, Proceedings 33rd Annual ACM Symposium on Theory of Computing, Greece, pp. 241–246 (2001)Google Scholar
- 16.Schaefer, M., Sedgwick, E., Stefankovič, D.: Recognizing string graphs in NP. In: STOC 2002, Proceedings 34th Annual ACM Symposium on Theory of Computing (2002)Google Scholar