The four-color theorem for small maps. (English) Zbl 0313.05109


05C15 Coloring of graphs and hypergraphs
Full Text: DOI


[1] Ore, O., (The Four Color Problem (1967), Academic Press: Academic Press New York) · Zbl 0149.21101
[2] Ore, O.; Stemple, J. G., Numerical calculations on the four color problem, J. Combinatorial Theory, 8, 65-78 (1970) · Zbl 0187.45503
[3] Heesch, H., Untersuchungen zum Vierfarbenproblem (1969), Mannheim · Zbl 0187.20904
[4] Heesch, H., Chromatic reduction of the triangulations \(T_e, e = e_5 + e_7\), J. Combinatorial Theory (B), 13, 46-55 (1972) · Zbl 0242.05110
[5] F. Bernhart; F. Bernhart
[6] J. Mayer; J. Mayer
[7] J. Mayer; J. Mayer
[8] F. Allaire and E. R. Swart; F. Allaire and E. R. Swart · Zbl 0398.05034
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.