On the entire coloring conjecture

    Authors

    D. P. Sanders;Y. Zhao

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    Can. Math. Bul.-Bul. Can. Math.

    Keywords

    PLANE GRAPHS; THEOREM; NUMBER; Mathematics

    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 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.

    Journal Title

    Canadian Mathematical Bulletin-Bulletin Canadien De Mathematiques

    Volume

    43

    Issue/Number

    1

    Publication Date

    1-1-2000

    Document Type

    Article

    Language

    English

    First Page

    108

    Last Page

    114

    WOS Identifier

    WOS:000090025900017

    ISSN

    0008-4395

    Share

    COinS