A Family of Chromatically Unique Graphs
Jieming Wang · Journal of Shanghai Second Polytechnic University · 1999
According to studying the chromatic polynomial and its coefficients of graphs. We show that a family of graphs which have n notes and n+2 edges(n≥7) are chromatically unique, The graphs in this family can be obtained from the wheel graphs by deleting some of the spoke edges.