Even triangulations of ³ and the coloring of graphs
Even triangulations of ³ and the coloring of graphs
复制标题
甚至 ³ 的三角剖分和图形的着色
DOI:
--
复制
发表时间:
1978
期刊:
影响因子:
--
通讯作者:
H. Onishi
中科院分区:
文献类型:
--
作者:
J. Goodman;H. Onishi
0. Introduction. With the Appel-Haken solution to the Four Color Problem [2], the question remains open of characterizing those graphs, planar or not, that are 4-colorable. This paper represents a step toward a solution by offering a new criterion for the 4-colorability of a graph embedded in 3-space, which was suggested by an analogous criterion for the 3-colorability of a graph embedded in the plane. The main result is that a graph in the 3-sphere S 3 is (vertex) 4-colorable if and only if it is a subcomplex of the 1-skeleton of an "even" triangulation of S3-one in which every edge has an even number of faces incident to it. The corresponding result one dimension lower is well known [4, Theorem 7.4.3]. In ?1, we present a summary of this theory with some auxiliary results, and in ?2 we present the parallel theory in 3 dimensions. Since the original submission of this paper, Robert D. Edwards has announced an (independent) proof of the main result, following an idea of P. Deligne, R. MacPherson, and J. Morgan (see Notices Amer. Math. Soc. 24 (1977), A-257). The beautiful sequence of papers by Steve Fisk entitled Geometric coloring theory, which has begun appearing still more recently in Advances in Math. (24 (1977), 298-340, et seqq.), also contains ideas which overlap ours to some extent. We express our gratitude to the referee for his helpful suggestions about tightening the exposition of the paper.