Plane embeddings of 2-trees and biconnected partial 2-trees

SIAM Journal on Discrete Mathematics

Volumn 9, Issue 4, 1996, Pages 577-596

  Proskurowski, Andrzej ^a   Sysło, Maciej M ^b   Winter, Pawel ^c  

^a UNIVERSITY OF OREGON   (United States)

^b UNIVERSITY OF WROC AW   (Poland)

^c UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

2 trees; Covering; Minimum cost perfect matching; Planar embeddings; Treewidth

Indexed keywords

EID: 4243078674     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480193256663     Document Type: Article

References (12)

1. S. ARNBORG AND A. PROSKUROWSKI, Linear time algorithms for NP-hard problems on graphs embedded in k-trees, Discrete Appl. Math., 23 (1989), pp. 11-24.
2. M. FELLOWS, Personal communication, 1986.
3. M. FELLOWS. F. HICKLING, AND M. M. SYSØO, A topological parameterization and hard graphs problems, Congr. Numer., 59 (1987), pp. 69-78.
4. S. M. HEDETNIEMI, A. PROSKUROWSKI, AND M. M. SYSŁO, Interior graphs of maximal outer-plane graphs, J. Combin. Theory Ser. B, 38 (1985), pp. 156-167.
5. S. MAC LANE, A structural characterization of planar combinatorial graphs, Duke Math. J., 3 (1937), pp. 460-472.
6. A. PROSKUROWSKI, Separating subgraphs in k-trees: Cables and caterpillars, Discrete Math., 49 (1984), pp. 275-285.
7. D. ROSE, On simple characterization of k-trees, Discrete Math., 7 (1974), pp. 317-322.
8. K. TAKAMIZAWA, T. NISHIZEKI, AND N. SAITO, Linear-time computability of combinatorial problems on series-parallel graphs, J. Assoc. Comput. Mach., 29 (1982), pp. 623-641.
9. M. M. SYSŁO, Independent face and vertex covers in plane graphs, Banach Center Publ., 25 (1989), pp. 177-185.
10. M. M. SYSŁO AND P. WINTER, Independent covers in outerplanar graphs, R. Karlsson, A. Lingas, eds., Lecture Notes in Computer Science 318, Springer-Verlag, Berlin, New York, 1988, pp. 242-254.
11. _, In-trees and plane embeddings of outerplanar graphs, BIT, 30 (1990), pp. 83-90.
12. J. WALD AND C. J. COLBOURN, Steiner trees, partial 2-trees, and minimum IFI networks, Networks, 13 (1983), pp. 159-167.