1988/12/01 by Andrew Vince · 265 citations
Computer Science · Mathematics · #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #Advanced Graph Theory Research #Mathematics #Combinatorics #Chromatic scale #Modulo #Generalization #Graph #Star (game theory) #Discrete mathematics
paper · doi:10.1002/jgt.3190120411
published in Journal of Graph Theory 12(4), 551-559 (Wiley)
openalex publication_date 1988/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/21
Abstract A generalization of the chromatic number of a graph is introduced such that the colors are integers modulo n , and the colors on adjacent vertices are required to be as far apart as possible.