Generalized K-Tuple Colorings of Cycles and Other Graphs
Abbreviated Journal Title
J. Comb. Theory Ser. B
Stahl's concept of k-tuple coloring the nodes of a graph is extended to specify that adjacent nodes must have i colors in common. Complete results for a minimum such coloring are obtained for bipartite graphs and odd cycles. Partial results are shown for complete graphs.
Journal of Combinatorial Theory Series B
Brigham, R. C. and Dutton, R. D., "Generalized K-Tuple Colorings of Cycles and Other Graphs" (1982). Faculty Bibliography 1980s. 174.