Abstract
We introduce a new class of clique separators, called base sets, for chordal graphs. Base sets of a chordal graph closely reflect its structure. We show that the notion of base sets leads to structural characterizations of planar k-trees and planar chordal graphs. Using these characterizations, we develop linear time algorithms for recognizing planar k-trees and planar chordal graphs. These algorithms are extensions of the Lexicographic_Breadth_First_Search algorithm for recognizing chordal graphs and are much simpler than the general planarity checking algorithm. Further, we use the notion of base sets to prove the equivalence of hamiltonian 2-trees and maximal outerplanar graphs.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Beeri, C., Fagin, R., Maier, D., Yannakakis, M., On the Desirability of Acyclic Database Schemes, JACM 30(3), 479–513,1983.
Golumbic, M.C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
Harary, F., Graph Theory, Addison Wesley, Reading, MA, 1969.
Ho, C., Lee, R.C.T., counting Clique Trees and Computing Perfect Elimination Schemes in Parallel, IPL, 31, 61–68, 1989.
Hopcroft, J.,Tarjan, R.E., Efficient Planarity Testing, JACM, 21(4), 549–568, 1974.
Klein, P.N., Efficient Parallel Algorithms for Chordal Graphs, FOCS, 150–161, 1988.
Rose, D., On Simple Characterizations of k-trees, Disc., Math., 7, 317–322, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, P.S., Veni Madhavan, C.E. (1989). A new class of separators and planarity of chordal graphs. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_30
Download citation
DOI: https://doi.org/10.1007/3-540-52048-1_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52048-1
Online ISBN: 978-3-540-46872-1
eBook Packages: Springer Book Archive