Semester
Spring
Date of Graduation
2002
Document Type
Dissertation
Degree Type
PhD
College
Eberly College of Arts and Sciences
Department
Mathematics
Committee Chair
Cun-Quan Zhang.
Abstract
We prove that chie( G) = Delta if Delta ≥ 5 and g ≥ 4, or Delta ≥ 4 and g ≥ 5, or Delta ≥ 3 and g ≥ 9. In addition, if chi(Sigma) > 0, then chie( G) = Delta if Delta ≥ 3 and g ≥ 8 where Delta, g is the maximum degree, the girth of the graph G, respectively.;It is proved that G is not critical if d¯ ≤ 6 and Delta ≥ 8, or d¯ ≤ 203 and Delta ≥ 9. This result generalizes earlier results.;Given a simple plane graph G, an edge-face k-coloring of G is a function &phis; : E(G) ∪ F(G) {lcub}1, ···, k{rcub} such that, for any two adjacent elements a, b ∈ E(G) ∪ F(G), &phis;( a) ≠ &phis;(b). Denote chie( G), chief(G), Delta( G) the edge chromatic number, the edge-face chromatic number and the maximum degree of G, respectively. We prove that chi ef(G) = chie( G) = Delta(G) for any 2-connected simple plane graph G with Delta(G) ≥ 24.
Recommended Citation
Luo, Rong, "Edge coloring of simple graphs and edge -face coloring of simple plane graphs" (2002). Graduate Theses, Dissertations, and Problem Reports. 1602.
https://researchrepository.wvu.edu/etd/1602