A counterexample to the conjecture of Aksionov and Mel'nikov on non-3- colorable planar graphs

DOI10.1016/0095-8956(84)90027-3zbMath0539.05041OpenAlexW2050640691MaRDI QIDQ793751

Han-kun Ma

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90027-3

zbMATH Keywords

3-colorableedge-critical planar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Some counterexamples associated with the three-color problem

This page was built for publication: A counterexample to the conjecture of Aksionov and Mel'nikov on non-3- colorable planar graphs