Ka, kMinors in graphs of bounded tree-width

Journal of Combinatorial Theory. Series B

Volumn 86, Issue 1, 2002, Pages 133-147

  Boöhme, Thomas ^a   Maharry, John ^b,c  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF LJUBLJANA   (Slovenia)

^c OHIO STATE UNIVERSITY   (United States)

Author keywords

Connectivity; Graph minor; Graph theory

Indexed keywords

EID: 0036749181     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2002.2119     Document Type: Article

References (13)

1. B. Bollobás and A. Thomason, Highly linked graphs, Combinatorica 16 (1996), 313-320.
2. R. Diestel, "Graph Decompositions - A Study in Infinite Graph Theory," Oxford Univ. Press, Oxford, 1990.
3. G. Ding, private communication.
4. M. Juvan, J. Marinček and B. Mohar, Elimination of local bridges, Math. Slovaca 47 (1997), 85-92.
5. W. Mader, Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend grosser Kantendichte, Abh. Math. Sem. Univ. Hamburg 37 (1972), 86-97.
6. J. Maharry, A characterization of graphs with no cube minor, J. Combin. Theory Ser. B 80 (2000), 179-201.
7. J. Maharry, An excluded minor theorem for the octahedron, J. Graph Theory 31 (1999), 95-100.
8. N. Robertson, private communication.
9. N. Robertson and P. D. Seymour, Graph minors IX. Disjoint crossed paths, J. Combin. Theory Ser. B 49 (1990), 40-77.
10. N. Robertson and P. D. Seymour, An outline of a disjoint paths algorithm, in "Paths, Flows, and VLSI-Layout" (B. Korte, L. Lovász, H. J. Prömel, and A. Schrijver, Eds.), pp. 267-292, Springer-Verlag, Berlin, 1990.
11. B. Oporowski, J. Oxley and R. Thomas, Typical subgraphs of 3- and 4-connected graphs, J. Combin. Theory Ser. B 57 (1993), 239-257.
12. R. Thomas, Recent excluded minor theorems for graphs, in "Surveys in Combinatorics, 1999 (Canterbury)," pp. 201-222, Cambridge Univ. Press, Cambridge, UK, 1999.
13. K. Wagner, "Über eine Eigenschaft der ebenen Komplexe, Math. Ann. 114 (1937), 570-590.