Edge-disjoint odd cycles in graphs with small chromatic numbers

DOI10.5802/aif.1691zbMath0923.05034OpenAlexW2048584632WikidataQ114013476 ScholiaQ114013476MaRDI QIDQ1296141

Claude Berge, Bruce A. Reed

Publication date: 12 July 1999

Published in: Annales de l'Institut Fourier (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=AIF_1999__49_3_783_0

zbMATH Keywords

graphchromatic numbergameswinning strategypositional gameedge-disjoint odd cyclesmonochromatic odd cycle

Mathematics Subject Classification ID

Games involving graphs (91A43) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Positional games (pursuit and evasion, etc.) (91A24)

Related Items

Negative (and positive) circles in signed graphs: a problem collection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hajos' graph-coloring conjecture: Variations and counterexamples
• On the optimal transversals of the odd cycles
• Optimal packings of edge-disjoint odd cycles
• Normal hypergraphs and the perfect graph conjecture
• Une classe d'hypergraphes bichromatiques
• On the presence of disjoint subgraphs of a specified type