Numerical calculations on the four-color problem

DOI10.1016/S0021-9800(70)80009-6zbMath0187.45503OpenAlexW2072546650MaRDI QIDQ5581296

Joel G. Stemple, Øystein Ore

Publication date: 1970

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

Full work available at URL: https://doi.org/10.1016/s0021-9800(70)80009-6

zbMATH Keywords

topology

Related Items

An iV‐colour theorem for sequentially constructed planar graphs with myopic colouring ⋮ Inégalités nouvelles dans le problème des quatre couleurs ⋮ The four-color theorem for small maps ⋮ Five-coloring planar maps ⋮ A class of planar four-colorable graphs ⋮ An existence theorem for planar maps