A new class of separators and planarity of chordal graphs
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.
Unable to display preview. Download preview PDF.
- [G80]Golumbic, M.C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.Google Scholar
- [H69]Harary, F., Graph Theory, Addison Wesley, Reading, MA, 1969.Google Scholar
- [HL89]Ho, C., Lee, R.C.T., counting Clique Trees and Computing Perfect Elimination Schemes in Parallel, IPL, 31, 61–68, 1989.Google Scholar
- [K88]Klein, P.N., Efficient Parallel Algorithms for Chordal Graphs, FOCS, 150–161, 1988.Google Scholar
- [R72]Rose, D., On Simple Characterizations of k-trees, Disc., Math., 7, 317–322, 1972.Google Scholar