On the entire coloring conjecture
Abbreviated Journal Title
Can. Math. Bul.-Bul. Can. Math.
PLANE GRAPHS; THEOREM; NUMBER; Mathematics
The Four Color Theorem says that the faces (or vertices) of a plane graph may be colored with four colors. Vizing's Theorem says that the edges of a graph with maximum degree Delta may be colored with Delta + 1 colors. In 1972, Kronk and Mitchem conjectured that the vertices, edges, and faces of a plane graph may be simultaneously colored with Delta + 4 colors. In this article, we give a simple proof that the conjecture is true if Delta greater than or equal to 6.
Canadian Mathematical Bulletin-Bulletin Canadien De Mathematiques
"On the entire coloring conjecture" (2000). Faculty Bibliography 2000s. 2786.