Highly parity linked graphs

Combinatorica

Volumn 29, Issue 2, 2009, Pages 215-225

  Kawarabayashi, Ken Ichi ^a   Reed, Bruce ^b  

^a TOHOKU UNIVERSITY   (Japan)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 67650763407     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-009-2178-y     Document Type: Article

References (22)

1. T. Böhme K. Kawarabayashi J. Maharry B. Mohar 2009 Linear connectivity forces large complete bipartite graph minors J. Combin. Theory Ser. B 99 2 323
2. B. Bollobás A. Thomason 1996 Highly linked graphs Combinatorica 16 3 313 320
3. M. Chudnovsky J. Geelen B. Gerards L. Goddyn M. Lohman P. Seymour 2006 Packing non-zero A-paths in group labelled graphs Combinatorica 26 5 521 532
4. I. Dejter and V. Neumann-Lara: Unboundedness for generalized odd cycle traversability and a Gallai conjecture, paper presented at the Fourth Caribbean Conference on Computing, Puerto Rico, 1985.
5. R. Diestel: Graph Theory, 2nd Edition, Springer, 2000.
6. P. Erdos L. Pósa 1962 On the maximal number of disjoint circuits of a graph Publ. Math. Debrecen 9 3 12
7. J. Geelen, B. Gerards, L. Goddyn, B. Reed, P. Seymour and A. Vetta: The odd case of Hadwiger's conjecture, preprint.
8. H. A. Jung 1970 Eine Verallgemeinerung des n-fachen Zusammenhangs für Graphen Math. Ann. 187 95 103
9. K. Kawarabayashi A. Kostochka G. Yu 2006 On sufficient degree conditions for a graph to be k-linked Combin. Probab. Comput. 15 685 694 (Pubitemid 44155899)
10. K. Kawarabayashi A. Nakamoto 2007 The Erdos-Pósa property for odd cycles on an orientable fixed surface Discrete Math 307 764 768
11. k-subdivisions, and the Erdos-Pósa property; preprint.
12. D. G. Larman P. Mani 1974 On the existence of certain configurations within graphs and the 1-skeletons of polytopes Proc. London Math Soc. 20 144 160
13. L. Lovász and M. D. Plummer: Matching Theory, Ann. of Discrete Math. 29, (1986).
14. W. Mader 1968 Homomorphiesätze für Graphen Math. Ann. 178 154 168
15. W. Mader 1972 Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großr Kantendichte Abh. Math. Sem. Univ. Hamburg 37 86 97
16. W. Mader 1978 Über die Maximalzahl kreuzungsfreier H-Wege Arch. Math. 31 387 402
17. D. Rautenbach B. Reed 2001 The Erdos-Pósa property for odd cycles in highly connected graphs Combinatorica 21 2 267 278
18. B. Reed 1999 Mangoes and blueberries Combinatorica 19 2 267 296
19. P. Seymour: Matroid minors, in: Handbook of Combinatorics (eds: R. L. Graham, M. Grötschel and L. Lóvasz), North-Holland, Amsterdam, 1985, 419-431.
20. R. Thomas P. Wollan 2005 An improved linear edge bound for graph linkages Europ. J. Combinatorics 26 253 275
21. C. Thomassen 1988 On the presence of disjoint subgraphs of a specified type J. Graph Theory 12 101 111
22. C. Thomassen 2001 The Erdos-Pósa property for odd cycles in graphs with large connectivity Combinatorica 21 2 321 333