On the size of edge-coloring critical graphs with maximum degree 4 |
| |
| Authors: | Lianying Miao Shiyou Pang |
| |
| Institution: | School of Science, China University of Mining and Technology, Xuzhou, 280001, PR China |
| |
| Abstract: | In 1968, Vizing proposed the following conjecture: If G=(V,E) is a Δ-critical graph of order n and size m, then  . This conjecture has been verified for the cases of Δ≤5. In this paper, we prove that  when Δ=4. It improves the known bound for Δ=4 when n>6. |
| |
| Keywords: | Conjecture Edge-coloring Edge-coloring critical graphs |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
