Abstract : This paper, all graphs will be finite, loopless and will have no parallel lines. Let G be a 2-connected planar graph with V(G)=p points. Suppose G has some fixed imbedding Phi: G approaches R-sq in the plane. The pair (G Phi) is often called a plane graph. A cyclic coloration of (G Phi) is an assignment to colors to the points of G such that for any face-bounding cycle F of (G Phi), the points of F have different colors. The cyclic coloration number chi sub c ((G Phi)) is the minimum number of colors in any cyclic coloration of (G, Phi). The main result of the present paper is to show that if (G, Phi) is a 3-connected plane graph, then chi sub c (G, Phi) p* (G, Phi)+ 9. Moreover, if rho* is sufficiently large of sufficiently large or sufficiently small, then this bound on chi sub c can be improved somewhat.
[1]
M. Plummer.
A Theorem on Matchings in the Plane
,
1988
.
[2]
W. T. Tutte.
How to Draw a Graph
,
1963
.
[3]
Carsten Thomassen,et al.
Planarity and duality of finite and infinite graphs
,
1980,
J. Comb. Theory B.
[4]
O. Ore.
The Four-Color Problem
,
1967
.
[5]
K. Appel,et al.
Every planar map is four colorable. Part II: Reducibility
,
1977
.
[6]
Hikoe Enomoto,et al.
Contractible edges in 3-connected graphs
,
1987,
J. Comb. Theory, Ser. B.
[7]
K. Appel,et al.
Every planar map is four colorable. Part I: Discharging
,
1977
.