Rooted minor problems in highly connected graphs

Discrete Mathematics

Volumn 287, Issue 1-3, 2004, Pages 121-123

  Kawarabayashi, Ken Ichi ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Connectivity; Rooted minor

Indexed keywords

BOUNDARY VALUE PROBLEMS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; NUMBER THEORY; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

CONNECTIVITY; MINOR PROBLEMS; ROOTED MINOR; SUBGRAPHS;

GRAPH THEORY;

EID: 4644303396     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2004.07.007     Document Type: Article

References (13)

1. T. Böhme, K. Kawarabayashi, J. Maharry, B. Mohar, Linear connectivity forces dense minors, preprint.
2. B. Bollobás, A. Thomason, Highly linked graphs, Combinatorica 16 (1996) 313-320.
3. R. Diestel, Graph Theory, second ed., Springer, Berlin, 2000.
4. 4,4-minor free graphs, Graphs Combin, 17 (2001) 265-274.
5. L. Jøorgensen, K. Kawarabayashi, Extremal results for rooted minor problems, preprint.
6. D. Kühn, D. Osthus, Forcing unbalanced complete bipartite minors, Europ. J. Combinatorics, to appear.
7. 4,4 as a minor, Combinatorica, to appear.
8. s,t-minors in graphs with given average degree, submitted.
9. J. Myers, A. Thomason, The extremal function for noncomplete graph minors, Combinatorica, to appear.
10. N. Robertson, P.D. Seymour, Graph minors. XIII. The disjoint paths problem, J. Combin. Theory Ser. B 63 (1995) 162-210.
11. N. Robertson, P.D. Seymour, Graph Minors IX. Disjoint crossed paths, J. Combin. Theory Ser. B 49 (1990) 40-77.
12. 6-free graphs, Combinatorica 13 (1993) 279-361.
13. R. Thomas, P. Wollan, An improved linear edge bound for graph linkages, submitted.