A special k-coloring for a connected k-c
โ
Guantao Chen; Richard H. Schelp; Warren E. Shreve
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 293 KB
For each positive integer k we consider the smallest positive integer f(k) (dependent only on k) such that the following holds: Each connected graph G with chromatic number x(G) --k can be properly vertex colored by k colors so that for each pair of vertices x0 and x~ in any color class there exist