Equitable colorings of Kronecker products of graphs
Journal
Discrete Applied Mathematics
Journal Volume
158
Journal Issue
16
Pages
1816-1826
Date Issued
2010
Author(s)
Abstract
For a positive integer k, a graph G is equitably k-colorable if there is a mapping f:V(G)→1,2,⋯,k such that f(x)≠f(y) whenever xy∈E(G) and
f-1(i)|-|f-1(j)
≤1 for 1≤i
Type
journal article