Graph Minors and Linkages

Journal of Graph Theory

Volumn 49, Issue 1, 2005, Pages 75-91

  Chen, G ^a   Gould, R J ^b   Kawarabayashi, K ^c   Pfender, F ^d   Wei, B ^e  

^a GEORGIA STATE UNIVERSITY   (United States)

^b EMORY UNIVERSITY   (United States)

^c TOHOKU UNIVERSITY   (Japan)

^d TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^e UNIVERSITY OF MISSISSIPPI   (United States)

Author keywords

Connectivities; Degrees; Graph minors; k linked graphs

Indexed keywords

INTEGRATION; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES; NUMERICAL ANALYSIS; SET THEORY; THEOREM PROVING;

CONNECTIVITIES; DEGREES; GRAPH MINORS; K-LINKED GRAPHS;

GRAPH THEORY;

EID: 18744407316     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.20067     Document Type: Article

References (23)

1. B. Bollobás and A. Thomason, Highly linked graphs, Combinatorica 16 (1996), 313-320.
2. G. Chen, R. J. Gould, K. Kawarabayashi, F. Pfender, and B. Wei, On graph linkage problems, preprint.
3. G. A. Dirac, Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem, J Reine Angew Math 204 (1960), 116-131.
4. H. Hadwiger, Über eine Klassifikation der Streckenkomplexe, Vierteljahrsschr Naturforsch Ges Zürich 88 (1943), 133-142.
5. A. Huck, A sufficient condition for graphs to be weakly k-linked, Graphs and Combinatorics 7 (1991), 323-351.
6. I. T. Jakobsen, A homomorphism theorem with an application to the conjecture of Hadwiger, Studia Sci Math Hung 6 (1971), 151-160.
7. I. T. Jakobsen, On certain homomorphism properties of graphs I, Math Scand 31 (1972), 379-404.
8. I. T. Jakobsen, On certain homomorphism properties of graphs II, Math Scand 52(2) (1983), 229-261.
9. 8, J Graph Theory 18(5) (1994), 431-448.
10. H. A. Jung, Eine Verallgemeinerung des n-fachen Zusammenhangs fur Graphen, Math Ann 187 (1970), 95-103.
11. 4,4 as a minor, Combinatorica, accepted.
12. D. G. Larman and P. Mani, On the existence of certain configurations within graphs and the 1-skeleons of polytopes. Proc Londo Math Soc 20 (1974), 144-160.
13. W. Mader, Hinreichende Bedingungen fur die Existenz von Teilgraphen, die zu einem vollstämdogem Graphen homöomorph sind, Math Nachr 53 (1972), 145-150.
14. W. Mader, Homomorphiesätze für Graphen, Math Ann 178 (1968), 154-168.
15. W. Mader, Homomorphieeigenschaften und mittlere Kantendichte von Graphen, Math Annalen 174 (1967), 265-268.
16. N. Robertson and K. Chakravarti, Covering three edges with a bond in a nonseparable graph (Abstract), Combinatorics, 1979, Annals of Discrete Math. 8, M. Deza and I.G. Rosenberg, (Editors), North Holland, Amsterdam, 1980, 247p.
17. N. Robertson and P. Seymour, Graph minors XIII, the disjoint paths problem, J Combin Theory Ser B 63(1) (1995), 65-110.
18. 6-free graphs, Combinatorica 12 (1993), 279-361.
19. P. Seymour, Disjoint paths in graphs, Discrete Math 29 (1980), 293-309.
20. R. Thomas, private communication.
21. C. Thomassen, 2-linked graphs, Eur J Combinatorics 1 (1980), 371-378.
22. K. Wagner, Über eine Eigenschaft der ebenen Komplexe, Math Ann 114 (1937), 570-590.
23. X. Yu, private comminucation.