Skip to main content
Conference ProceedingsOPEN ACCESS

Chordal graphs as intersection graphs of pseudosegments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4372 LNCS 208-219
DOI: 10.1007/978-3-540-70904-6_21
4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Dangelmayr, C., & Felsner, S. (2007). Chordal graphs as intersection graphs of pseudosegments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4372 LNCS, pp. 208–219). Springer Verlag. https://doi.org/10.1007/978-3-540-70904-6_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free