On odd circuits in chromatic graphs

DOI10.1007/BF01894573zbMath0175.50301OpenAlexW1990324806MaRDI QIDQ5565636

Heinz A. Jung, William G. Brown

Publication date: 1969

Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01894573

zbMATH Keywords

topology

Related Items

Some remarks on even-hole-free graphs ⋮ Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs ⋮ Partition line graphs of multigraphs into two subgraphs with large chromatic numbers ⋮ Double-critical graph conjecture for claw-free graphs ⋮ Erdős-Lovász Tihany conjecture for graphs with forbidden holes ⋮ On separating sets of edges in contraction-critical graphs ⋮ Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers ⋮ Colour-critical graphs and hypergraphs ⋮ The Erdős-Lovász tihany conjecture for quasi-line graphs ⋮ A Relaxed Version of the Erdős–Lovász Tihany Conjecture

Cites Work

• Maximum-Minimum Sätze über Graphen
• On Representatives of Subsets
• Unnamed Item