Please use this identifier to cite or link to this item: https://doi.org/10.1007/s00373-012-1184-9
Title: On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two
Authors: Koh, K.M. 
Song, Z.-X.
Keywords: Chromatic index
Edge coloring
Overfull
Issue Date: Sep-2013
Source: Koh, K.M., Song, Z.-X. (2013-09). On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two. Graphs and Combinatorics 29 (5) : 1429-1441. ScholarBank@NUS Repository. https://doi.org/10.1007/s00373-012-1184-9
Abstract: The core GΔ of a graph G is the subgraph of G induced by the vertices of maximum degree Δ(G). In this paper, we show that if G is a connected graph with Δ(GΔ) ≤ 2 and Δ(G)≥1/2({pipe}V(G){pipe}-1), then G is of class 2 if and only if G is overfull. Our result generalizes several results of Hilton and Zhao. © 2012 Springer.
Source Title: Graphs and Combinatorics
URI: http://scholarbank.nus.edu.sg/handle/10635/103837
ISSN: 09110119
DOI: 10.1007/s00373-012-1184-9
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

28
checked on Feb 18, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.