论文信息 - Chromatically unique graphs

Chromatically unique graphs

We show that two infinite families of graphs are chromatically unique. The graphs in these families can be obtained from the wheel graphs by deleting some of the spoke edges. Also, we prove that certain related graphs are not chromatically unique.

Chong-Yun Chao | Earl Glen Whitehead | C. Chao

[1] Beatrice Loerinc. Chromatic uniqueness of the generalized θ-graph , 1978, Discret. Math..

[2] Hassler Whitney,et al. The Coloring of Graphs , 1932 .

[3] Chong-Yun Chao,et al. On chromatic equivalence of graphs , 1978 .

[4] W. T. Tutte. On chromatic polynomials and the golden ratio , 1970 .

[5] R. Read. An introduction to chromatic polynomials , 1968 .

[6] H. Whitney. A logical expansion in mathematics , 1932 .