Optimal packings of edge-disjoint odd cycles

Discrete Mathematics

Volumn 211, Issue 1-3, 2000, Pages 197-202

  Berge, Claude ^a   Reed, Bruce ^b  

^a Centre de Mathematique Sociale   (France)

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

Graphs; Odd cycle; Packings

Indexed keywords

EID: 0043284246     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00283-6     Document Type: Article

References (11)

1. C. Berge, Hypergraphs, Combinatorics of Finite Sets, North-Holland, Amsterdam, 1989.
2. C. Berge, J.-L. Fouquet, On the optimal transversals of the odd cycles, Discrete Math. 169 (1997) 169-176.
3. C. Berge, B. Reed, Edge-disjoint odd cycles in graphs with small chromatic number, Ann. Institute Fourier, T.49 (1999) 783-786.
4. P.C. Catlin, Hajos' graph colouring conjecture, J. Combin. Theory Ser. B 26 (1979) 268-274.
5. J.-C. Fournier, M. Las Vergnas, Une classe d'hypergraphes bichromatiques, Discrete Math. 2 (1979) 407-410.
6. L. Lovász, Normal hypergraphs and the perfect graph conjecture, Discrete Math. 2 (1972) 253-267.
7. L. Lovász, Private communication.
8. B. Reed, Mango and Blueberries, Combinatorica 19 (1999) 267-296.
9. B. Reed, Tree width and tangles, a new measure of connectivity and some applications, in: R. Bailey (Ed.), Survey in Combinatorics, London Math. Soc. Lecture Notes Series 241, Cambridge University Press, Cambridge, 1997, pp. 87-162.
10. C. Thomassen, On the presence of disjoint subgraphs of a specified type, J. Graph Theory 12 (1988) 101-111.
11. B. Toft, T.R. Jensen, Graph Coloring Problems, Wiley Interscience, New York, 1995.