Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs

DOI10.1016/0012-365X(95)00168-VzbMath0882.05063WikidataQ123027379 ScholiaQ123027379MaRDI QIDQ1356437

Eckhard Steffen

Publication date: 9 June 1997

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

zbMATH Keywords

cubic graphbottleneckTait colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Unnamed Item

This page was built for publication: Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs