All wheels with two missing consecutive spokes are chromatically unique

Discrete Mathematics

Volumn 184, Issue 1-3, 1998, Pages 71-85

  Dong, F M ^a   Liu, Y P ^a  

^a BEIJING JIAOTONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042858721     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00288-9     Document Type: Article

References (11)

1. C.Y. Chao and E.G. Whitehead, Jr., Chromatically unique graphs, Discrete Math. 27 (1979) 171-177.
2. G.L. Chia, The chromaticity of wheels with a missing spoke, Discrete Math. 82 (1990) 209-212.
3. G.A. Dirac, On rigid circuit graphs, Abh. Math. Sem. UNiv. Hamburgh 25 (1967) 71-76.
4. F.M. Dong, On the chromatic uniqueness of generalized wheel graphs, J. Math. Res. Exposition 10 (1990) 76-83 (in Chinese).
5. F.M. Dong, On the chromatic uniqueness of two families of graphs, Acta Math. Sinica 34 (1991) 242-251 (in Chinese).
6. F.M. Dong, Y.P. Liu and K.M. Koh, Almost all wheels with one missing spoke are chromatically unique, submitted.
7. E.J. Farrell, On chromatic coefficients, Discrete Math. 29 (1980) 257-264.
8. K.M. Koh and K.L. Teo, The search for chromatically unique graphs, Graphs Combin. 6 (1990) 259-285.
9. R.C. Read, An introduction to chromatic polynomials, J. Combin. Theory 4 (1968) 52-71.
10. W.T. Tutte, Graph Theory (Addison-Wesley, Reading, MA, 1984).
11. E.G. Whitehead, Jr. and L.C. Zhao, Cutpoints and the chromatic polynomial, J. Graph Theory 8 (1984) 371-377.