Title

On The Size Of Graphs Of Class 2 Whose Cores Have Maximum Degree Two

Keywords

Chromatic index; Edge coloring; Overfull

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.

Publication Date

9-1-2013

Publication Title

Graphs and Combinatorics

Volume

29

Issue

5

Number of Pages

1429-1441

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1007/s00373-012-1184-9

Socpus ID

84882827355 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/84882827355

This document is currently not available here.

Share

COinS