Chordal embeddings of planar graphs

Discrete Mathematics

Volumn 273, Issue 1-3, 2003, Pages 85-102

  Bouchitte V ^a   Mazoit, F ^a   Todinca, I ^b  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

Duality; Planar graphs; Treewidth

Indexed keywords

COMPUTATIONAL GEOMETRY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

DISCRETE MATHEMATICS; MATHEMATICAL TRIANGULATION TECHNIQUES; PLANAR GRAPHS;

TREES (MATHEMATICS);

EID: 0345376924     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(03)00230-9     Document Type: Conference Paper

References (16)

1. Arnborg S., Corneil D.G., Proskurowski A. Complexity of finding embeddings in a. k -tree SIAM J. Algebraic Discrete Methods. 8:1987;277-284.
2. Bodlaender H.L., Kloks T., Kratsch D. Treewidth and pathwidth of permutation graphs. SIAM J. Discrete Math. 8:1995;606-616.
3. Bouchitté V., Todinca I. Treewidth and minimum fill-in. grouping the minimal separators SIAM J. Comput. 31(1):2001;212-232.
4. Bouchitté V., Todinca I. Listing all potential maximal cliques of a graph. Theoret. Comput. Sci. 276(1-2):2002;17-32.
5. Diestel R. Graph Theory. 1997;Springer, Berlin.
6. Eppstein D. Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3(3):1999;1-27.
7. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
8. T. Kloks, Treewidth of circle graphs, in: Proceedings of the Fourth Annual International Symposium on Algorithms and Computation (ISAAC'93), Lecture Notes in Computer Science, Vol. 762, Springer, Berlin, 1993, pp. 108-117.
9. Kloks T., Kratsch D. Treewidth of chordal bipartite graphs. J. Algorithms. 19(2):1995;266-281.
10. T. Kloks, D. Kratsch, H. Müller, Approximating the bandwidth for asteroidal triple-free graphs, in: Proceedings of the Third Annual European Symposium on Algorithms (ESA'95), Lecture Notes in Computer Science, Vol. 979, Springer, Berlin, 1995, pp. 434-447.
11. D. Lapoire, Treewidth and duality in planar hypergraphs. http://dept-info.labri.u-bordeaux.fr/~lapoire/papers/dual_planar_treewidth.ps .
12. Parra A., Scheffler P. Characterizations and algorithmic applications of chordal graph embeddings. Discrete Appl. Math. 79(1-3):1997;171-188.
13. Robertson N., Seymour P. Graphs minors. III. Planar tree-width. J. Combin. Theory Ser. B. 36:1984;49-64.
14. Robertson N., Seymour P. Graphs minors. II. Algorithmic aspects of tree-width. J. Algorithms. 7:1986;309-322.
15. Seymour P.D., Thomas R. Call routing and the ratcatcher. Combinatorica. 14(2):1994;217-241.
16. Sundaram R., Sher Singh K., Pandu Rangan C. Treewidth of circular-arc graphs. SIAM J. Discrete Math. 7:1994;647-655.