Equitable edge‐colorings of simple graphs |
| |
| Authors: | Xia Zhang Guizhen Liu |
| |
| Institution: | 1. Department of mathematics, shandong normal university, jinan, shandong p. r. China, 250014;2. School of mathematics, shandong university jinan, shandong p. r. China, 250100 |
| |
| Abstract: | An edge‐coloring of a graph G is equitable if, for each v∈V(G), the number of edges colored with any one color incident with v differs from the number of edges colored with any other color incident with v by at most one. A new sufficient condition for equitable edge‐colorings of simple graphs is obtained. This result covers the previous results, which are due to Hilton and de Werra, verifies a conjecture made by Hilton recently, and substantially extends it to a more general class of graphs. © 2010 Wiley Periodicals, Inc. J Graph Theory 66:175‐197, 2011 |
| |
| Keywords: | simple graphs equitable edge‐coloring f‐coloring f‐chromatic index |
|
|
