Generalized k-tuple colorings of cycles and other graphs |
| |
| Authors: | RC Brigham RD Dutton |
| |
| Institution: | 1. Department of Mathematics and Statistics, University of Central Florida, P. O. Box 25000, Orlando, Florida 32816 USA;2. Department of Computer Sciences, University of Central Florida, P. O. Box 25000, Orlando, Florida 32816 USA |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
