| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420158 | Discrete Applied Mathematics | 2012 | 4 Pages |
Abstract
For a given integer k≥2k≥2, a balanced kk-coloring of a graph GG is a mapping c:V(G)→{0,1,2,…,k}c:V(G)→{0,1,2,…,k} such that |Aj|=|Aj′||Aj|=|Aj′| for 1≤j
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hsiang-Chun Hsu, Gerard Jennhwa Chang,