论文信息 - Face colorings of embedded graphs

Face colorings of embedded graphs

We characterize those graphs which have at least one embedding into some surface such that the faces can be properly colored in four or fewer colors. Embeddings into both orientable and nonorientable surfaces are considered.

Dan Archdeacon

[1] Loops in Duals , 1980 .

[2] Sukhamay Kundu,et al. Bounds on the number of disjoint spanning trees , 1974 .

[3] W. T. Tutte,et al. On the Imbedding of Linear Graphs in Surfaces , 1949 .

[4] François Jaeger. A Note on Sub-Eulerian Graphs , 1979, J. Graph Theory.

[5] Tait. 10. Remarks on the previous Communication , 1880 .

[6] Frank Harary,et al. Properties of almost all graphs and complexes , 1979, J. Graph Theory.