Title

On The Entire Coloring Conjecture

Abstract

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 Δ may be colored with Δ + 1 colors. In 1972, Kronk and Mitchem conjectured that the vertices, edges, and faces of a plane graph may be simultaneously colored with Δ + 4 colors. In this article, we give a simple proof that the conjecture is true if Δ ≥ 6.

Publication Date

1-1-2000

Publication Title

Canadian Mathematical Bulletin

Volume

43

Issue

1

Number of Pages

108-114

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.4153/CMB-2000-017-7

Socpus ID

0034147147 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0034147147

This document is currently not available here.

Share

COinS