Chordal graphs as intersection graphs of pseudosegments

Authors:
Cornelia Dangelmayr;Stefan Felsner
Affiliations:
Freie Universität Berlin, Institut für Mathematik II, Berlin, Germany;Technische Universität Berlin, Institut für Mathematik, Berlin, Germany
Venue:
GD'06 Proceedings of the 14th international conference on Graph drawing
Year:
2006

Citing 7
Cited 1

Intersection graphs of paths in a tree

Journal of Combinatorial Theory Series B
String graphs. II.: Recognizing string graphs is NP-hard

Journal of Combinatorial Theory Series B
On grid intersection graphs

Discrete Mathematics
A special planar satisfiability problem and a consequence of its NP-completeness

Discrete Applied Mathematics
Intersection graphs of segments

Journal of Combinatorial Theory Series B
Recognizing string graphs in NP

Journal of Computer and System Sciences - STOC 2002
Contact and intersection representations

GD'04 Proceedings of the 12th international conference on Graph Drawing

Geometric intersection graph: do short cycles help?

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.