\(K_ 5\) is the only double-critical 5-chromatic graph

DOI10.1016/0012-365X(87)90242-1zbMath0613.05022MaRDI QIDQ1088672

Michael Stiebitz

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic numberchromatic criticaldouble-critical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Some remarks on even-hole-free graphs ⋮ On constructive methods in the theory of colour-critical 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 ⋮ On the double-critical graph conjecture ⋮ From logical gates synthesis to chromatic bicritical clutters ⋮ Double-critical graph conjecture for claw-free graphs ⋮ Erdős-Lovász Tihany conjecture for graphs with forbidden holes ⋮ Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers ⋮ The Erdős-Lovász tihany conjecture for quasi-line graphs ⋮ A Relaxed Version of the Erdős–Lovász Tihany Conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(K_ 5\) is the only double-critical 5-chromatic graph