Title

A Note On Vizing'S Independence Number Conjecture Of Edge Chromatic Critical Graphs

Keywords

Class one; Class two; Critical graph; Edge coloring; Independence number

Abstract

In 1968, Vizing conjectured that, if G is a Δ-critical graph with n vertices, then α (G) ≤ n / 2, where α (G) is the independence number of G. In this note, we verify this conjecture for n ≤ 2 Δ. © 2006 Elsevier B.V. All rights reserved.

Publication Date

8-6-2006

Publication Title

Discrete Mathematics

Volume

306

Issue

15

Number of Pages

1788-1790

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/j.disc.2006.03.040

Socpus ID

33745968185 (Scopus)

Source API URL

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

This document is currently not available here.

Share

COinS