Title

The Size Of Edge Chromatic Critical Graphs With Maximum Degree 6

Keywords

Class one; Class two; Critical graphs and edge chromatic number

Abstract

In 1968, Vizing [Uaspekhi Mat Nauk23 (1968) 117-134; Russian Math Surveys 23 (1968), 125-142] conjectured that for any edge chromatic critical graph G = (V, E) with maximum degree A, |E| ≥ 1/2 {(Δ-1)\V| +3}. This conjecture has been verified for Δ ≥ 5. In this article, by applying the discharging method, we prove the conjecture for Δ = 6. © 2008 Wiley Periodicals, Inc.

Publication Date

1-1-2009

Publication Title

Journal of Graph Theory

Volume

60

Issue

2

Number of Pages

149-171

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1002/jgt.20351

Socpus ID

62549145347 (Scopus)

Source API URL

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

This document is currently not available here.

Share

COinS