On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two

    Authors

    K. M. Koh;Z. X. Song

    Comments

    Authors: contact us about adding a copy of your work at [email protected]

    Abbreviated Journal Title

    Graphs Comb.

    Keywords

    Edge coloring; Chromatic index; Overfull; INDEX CRITICAL GRAPHS; CHROMATIC INDEX; VERTICES; Mathematics

    Abstract

    The core G (Delta) of a graph G is the subgraph of G induced by the vertices of maximum degree Delta(G). In this paper, we show that if G is a connected graph with Delta(G (Delta)) a parts per thousand currency sign 2 and , then G is of class 2 if and only if G is overfull. Our result generalizes several results of Hilton and Zhao.

    Journal Title

    Graphs and Combinatorics

    Volume

    29

    Issue/Number

    5

    Publication Date

    1-1-2013

    Document Type

    Article

    Language

    English

    First Page

    1429

    Last Page

    1441

    WOS Identifier

    WOS:000323374100023

    ISSN

    0911-0119

    Share

    COinS
     

    Accessibility Statement

    This item was created or digitized prior to April 24, 2027, or is a reproduction of legacy media created before that date. It is preserved in its original, unmodified state specifically for research, reference, or historical recordkeeping. In accordance with the ADA Title II Final Rule, the University Libraries provides accessible versions of archival materials upon request. To request an accommodation for this item, please submit an accessibility request form.