Title of article
Equitable Coloring and the Maximum Degree
Author/Authors
Chen، نويسنده , , Bor-Liang and Lih، نويسنده , , Ko-Wei and Wu، نويسنده , , Pou-Lin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1994
Pages
5
From page
443
To page
447
Abstract
Let Δ(G) denote the maximum degree of a graph G. The equitable Δ-coloring conjecture asserts that a connected graph G is equitably Δ(G)-colorable if it is different from Km , C2m + 1 and K2m + 1,2m + 1 for all m ⩾ 1. This conjecture is established for graphs G satisfying Δ(G) ⩾ |G|/2 or Δ(G) ⩽ 3.
Journal title
European Journal of Combinatorics
Serial Year
1994
Journal title
European Journal of Combinatorics
Record number
1548515
Link To Document