On the size of edge chromatic critical graphs

Authors

    Authors

    D. P. Sanders;Y. Zhao

    Abbreviated Journal Title

    J. Comb. Theory Ser. B

    Keywords

    chromatic number; class one; class two; Mathematics

    Abstract

    In this paper, by applying the discharging method, we prove that if G = (V, E) is a Delta-critical graph, then \E\ greater than or equal to 1/4\V\(Delta + root2Delta-1). (C) 2002 Elsevier Science (USA).

    Journal Title

    Journal of Combinatorial Theory Series B

    Volume

    86

    Issue/Number

    2

    Publication Date

    1-1-2002

    Document Type

    Article

    Language

    English

    First Page

    408

    Last Page

    412

    WOS Identifier

    WOS:000178979600012

    ISSN

    0095-8956

    Share

    COinS