Scholarly Works - Journal articles
Journal article
Annals of Combinatorics
·
January 1, 2026
Given a graph G, the k-coloring graph Ck(G) is constructed by selecting proper k-colorings of G as vertices, with an edge between two colorings if they differ in the color of exactly one vertex. The number of vertices in Ck(G) is the famous chromatic polyn ...
Full text
Open Access
Cite
