The Erdo{combining double acute accent}s-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces

Discrete Mathematics

Volumn 307, Issue 6, 2007, Pages 764-768

  Kawarabayashi, Ken Ichi ^a   Nakamoto, Atsuhiro ^b  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b YOKOHAMA NATIONAL UNIVERSITY   (Japan)

Author keywords

Erdo combining double acute accent s P sa property; Odd cycles; Orientable surfaces

Indexed keywords

GRAPH THEORY; NUMERICAL METHODS;

NON NEGATIVE INTEGER; ODD CYCLES; ORIENTABLE SURFACES;

COMPUTATIONAL GEOMETRY;

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

References (12)

1. Berge C., and Reed B. Optimal packing of edge-disjoint odd cycles. Discrete Math. 211 (2000) 197-202
2. Erdös P., and Posá L. On the maximal number of disjoint circuits of a graph. Publ. Math. Debrecen 9 (1962) 3-12
3. de Graaf M., and Schrijver A. Grid minors of the graphs on the torus. J. Combin. Theory Ser. B 61 (1994) 57-62
4. K. Kawarabayashi, B. Reed, Highly parity linked graphs, Combinatorica, to appear.
5. Kawarabayashi K., and Wollan P. Non-zero disjoint cycles in highly connected group labelled graphs. J. Combin. Theory Ser. B. 96 (2006) 296-301
6. Král' D., and Voss H.J. Edge-disjoint odd cycles in planar graphs. J. Combin. Theory Ser. B 90 (2004) 107-120
7. Mohar B., and Thomassen C. Graphs on Surfaces (2001), Johns Hopkins University Press, Baltimore, MD
8. Rautenbach D., and Reed B. The Erdo{combining double acute accent}s-Pósa property for odd cycles in highly connected graphs. Combinatorica 21 (2001) 267-278
9. Reed B. Mangoes and blueberries. Combinatorica 19 (1999) 267-296
10. Robertson N., and Seymour P. Graph minors. V. Excluding a planar graph. J. Combin. Theory Ser. B 41 (1986) 92-114
11. Thomassen C. On the presence of disjoint subgraphs of a specified type. J. Graph Theory 12 (1988) 101-111
12. Thomassen C. The Erdo{combining double acute accent}s-Pósa property for odd cycles in graphs of large connectivity. Combinatorica 21 (2001) 321-333