One counterexample for two conjectures on three coloring

DOI10.1016/0012-365X(77)90059-0zbMath0377.05019WikidataQ123022740 ScholiaQ123022740MaRDI QIDQ1246542

Richard Steinberg, Leonid S. Mel'nikov

Publication date: 1978

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

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item, The size of edge-critical uniquely 3-colorable planar graphs, Size of edge-critical uniquely 3-colorable planar graphs, A note on uniquely 3-colourable planar graphs

Cites Work

• On uniquely 3-colorable planar graphs
• Parallel concepts in graph theory