Even triangulations of $S^{3}$ and the coloring of graphs
HTML articles powered by AMS MathViewer
- by Jacob Eli Goodman and Hironori Onishi PDF
- Trans. Amer. Math. Soc. 246 (1978), 501-510 Request permission
Abstract:
A simple necessary and sufficient condition is given for the vertices of a graph, planar or not, to be properly four-colorable. This criterion involves the notion of an βevenβ triangulation of ${S^3}$ and generalizes, in a natural way, a corresponding criterion for the three-colorability of planar graphs.References
- Ethan Akin, Manifold phenomena in the theory of polyhedra, Trans. Amer. Math. Soc. 143 (1969), 413β473. MR 253329, DOI 10.1090/S0002-9947-1969-0253329-1
- K. Appel and W. Haken, Every planar map is four colorable, Bull. Amer. Math. Soc. 82 (1976), no.Β 5, 711β712. MR 424602, DOI 10.1090/S0002-9904-1976-14122-5
- Norman C. Dalkey, Parity patterns on even triangulated polygons, J. Combinatorial Theory 2 (1967), 100β102. MR 204315, DOI 10.1016/S0021-9800(67)80117-0
- Oystein Ore, The four-color problem, Pure and Applied Mathematics, Vol. 27, Academic Press, New York-London, 1967. MR 0216979
Additional Information
- © Copyright 1978 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 246 (1978), 501-510
- MSC: Primary 05C15; Secondary 57M15
- DOI: https://doi.org/10.1090/S0002-9947-1978-0515556-0
- MathSciNet review: 515556