On tree-partitions of graphs

Discrete Mathematics

Volumn 149, Issue 1-3, 1996, Pages 45-58

  Ding, Guoli ^a   Oporowski, Bogdan ^a  

^a LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013499485     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(94)00337-I     Document Type: Article

References (7)

1. G. Ding and B. Oporowski, Some results on tree decomposition of graphs, J. Graph Theory, to appear.
2. R. Halin, Tree-partitions of infinite graphs, Discrete Math. 97 (1991) 203-217.
3. I. Kříž and R. Thomas, The Menger-like property of the tree-width of infinite graphs, J. Combin. Theory Ser. B 52 (1991) 86-91.
4. N. Robertson and P. Seymour, Graph minors. III. Planar tree-width, J. Combin. Theory Ser. B 36 (1984) 49-64.
5. N. Robertson and P. Seymour, Graph minors. V. Excluding a planar graph, J. Combin. Theory Ser. B 41 (1986) 92-114.
6. N. Robertson, P. Seymour and R. Thomas, Quickly excluding a planar graph, submitted.
7. D. Seese, Tree-partite graphs and the complexity of algorithms, P-Math 08/86, Akademie der Wissenschaften der DDR, Karl Weierstrass Institut für Mathematik, Berlin (1986).