Coloring edges of graphs embedded in a surface of characteristic zero

Authors

    Authors

    D. P. Sanders;Y. Zhao

    Abbreviated Journal Title

    J. Comb. Theory Ser. B

    Keywords

    Mathematics

    Abstract

    Consider graphs that are embeddable in a surface of characteristic zero. Class two graphs of this type with maximum degree Deltaless than or equal to6 are known to exist. Hind and Zhao showed that such graphs with maximum degree Deltagreater than or equal to8 must be class one. This article shows that such graphs with maximum degree Delta = 7 also must be class one, completing the analysis of these surfaces. These are the first surfaces where the maximum degree of class two graphs has been determined. (C) 2002 Elsevier Science (USA). All rights reserved.

    Journal Title

    Journal of Combinatorial Theory Series B

    Volume

    87

    Issue/Number

    2

    Publication Date

    1-1-2003

    Document Type

    Article

    Language

    English

    First Page

    254

    Last Page

    263

    WOS Identifier

    WOS:000181209100004

    ISSN

    0095-8956

    Share

    COinS