Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
420276 | Discrete Applied Mathematics | 2010 | 11 Pages |
Abstract
For a positive integer kk, a graph GG is equitably kk-colorable if there is a mapping f:V(G)→{1,2,…,k}f:V(G)→{1,2,…,k} such that f(x)≠f(y)f(x)≠f(y) whenever xy∈E(G)xy∈E(G) and ||f−1(i)|−|f−1(j)||≤1||f−1(i)|−|f−1(j)||≤1 for 1≤i
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Wu-Hsiung Lin, Gerard J. Chang,