Sreenivasa, Kumar P and Veni, Madhavan (1989) A new class of separators and planarity of chordal graphs. [Book Chapter]
Full text not available from this repository. (Request a copy)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.
| Item Type: | Book Chapter |
|---|---|
| Publication: | Lecture Notes in Computer Science |
| Series.: | Lecture Notes in Computer Science |
| Publisher: | Springer |
| Additional Information: | Copyright to this article belongs to Springer. |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 15 Jul 2010 06:18 |
| Last Modified: | 15 Jul 2010 06:30 |
| URI: | http://eprints.iisc.ac.in/id/eprint/29296 |
Actions (login required)
 |
View Item |
