On odd circuits in chromatic graphs

DOI10.1007/BF01894573MaRDI QIDQ5565636zbMATH OpenOpenAlexFDO

Authors William G. Brown, Heinz A. Jung

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

Cites work

• scientific article; zbMATH DE number 3154393 (Why is no real title available?)
• Maximum-Minimum Sätze über Graphen
• On Representatives of Subsets

Cited in

(10)

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

This page was built for publication: On odd circuits in chromatic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5565636)