Chordal Graphs as Intersection Graphs of Pseudosegments
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. The main contribution is a construction which shows that all chordal graphs which have a representation as intersection graph of subpaths on a tree are representable. A family of intersection graphs of substars of a star is used to show that not all chordal graphs are representable by pseudosegments.
- 1.Bodirsky, M., Dangelmayr, C., Kára, J.: Representing Series-parallel Graphs as Intersection Graphs of Line Segments in Three Directions (submitted)Google Scholar
- 4.de Fraysseix, H., de Mendez, P.O., Pach, J.: Representation of planar graphs by segments. In: Colloquia Mathematica Societatis János Bolyai, Intuitive Geometry, Szeged, Hungary (1991)Google Scholar
- 5.de Fraysseix, H., de Mendez, P.O.: Contact and Intersection Representations. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 217–227. Springer, Heidelberg (2005)Google Scholar
- 12.Scheinerman, E.R.: Intersection classes and multiple intersection parameters of graphs, PhD thesis, Princeton University (1984)Google Scholar