Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T10:21:56.145Z Has data issue: false hasContentIssue false

On the Entire Coloring Conjecture

Published online by Cambridge University Press:  20 November 2018

Daniel P. Sanders
Affiliation:
23 Cliff Road Belle Terre, NY 11777 USA, email: dan@rentec.com
Yue Zhao
Affiliation:
Department of Mathematics University of Central Florida PO Box 161364 Orlando, FL 32816-1364 USA, email: yzhao@pegasus.cc.ucf.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 \,\ge \,6$ .

Keywords

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 2000