An application of Vizing and Vizing-like adjacency lemmas to Vizing’s Independence Number Conjecture of edge chromatic critical graphs |
| |
Authors: | Rong Luo Yue Zhao |
| |
Institution: | a Department of Mathematical Sciences, Middle Tennessee State University, Murfreesboro, TN 37130, United States b Department of Mathematics, University of Central Florida, Orlando, FL 32816-1364, United States |
| |
Abstract: | In 1968, Vizing conjectured that, if G is a Δ-critical graph with n vertices, then , where α(G) is the independence number of G. In this note, we apply Vizing and Vizing-like adjacency lemmas to this problem and obtain better bounds for Δ∈{7,…,19}. |
| |
Keywords: | Edge coloring Independence number Critical graphs |
本文献已被 ScienceDirect 等数据库收录! |
|