On odd circuits in chromatic graphs

DOI10.1007/BF01894573zbMATH Open0175.50301OpenAlexW1990324806MaRDI QIDQ5565636FDOQ5565636

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

• Maximum-Minimum Sätze über Graphen
• On Representatives of Subsets
• Title not available (Why is that?)

Cited In (10)

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