All wheels with two missing consecutive spokes are chromatically unique

Abstract This paper shows that every wheel of order n , n ⩾ 6, with two missing consecutive spokes is chromatically unique.

[1]  Lian-Chang Zhao,et al.  Cutpoints and the chromatic polynomial , 1984, J. Graph Theory.

[2]  Kee L. Teo,et al.  The search for chromatically unique graphs , 1990, Graphs Comb..

[3]  G. L. Chia.  The chromaticity of wheels with a missing spoke , 1990, Discret. Math..

[4]  E. J. Farrell,et al.  On chromatic coefficients , 1980, Discret. Math..

[5]  G. Dirac.  On rigid circuit graphs , 1961 .

[6]  Chong-Yun Chao,et al.  Chromatically unique graphs , 1979, Discret. Math..

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