On q-graphs

Discrete Mathematics

Volumn 172, Issue 1-3, 1997, Pages 9-16

  Chao, Chong Yun ^a   Guo, Zhi Yi ^b   Li, Nian Zuf ^c  

^a UNIVERSITY OF PITTSBURGH   (United States)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^c SHANGHAI SECOND POLYTECHNIC UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30244503205     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00263-4     Document Type: Article

References (9)

1. C.-Y. Chao, N.-Z. Li and S.-J. Xu, On q-trees, J. Graph Theory 10 (1986) 129-136.
2. G.L. Chia, A note on chromatic uniqueness of graphs, J. Graph Theory 10 (1986) 541-543.
3. G.L. Chia, Some remarks on the chromatic uniqueness of graphs, Ars Combin. 26 A (1988) 65-72.
4. R.E. Giudici, Some new families of chromatic unique graphs, Proc. First Chilean Math. Symp., Valparaiso, 1980, Lecture Notes in Pure and Appl. Math., vol. 96 (1985) 147-158.
5. R.E. Giudici, Some new families of chromatic unique graphs, Proc. First Chilean Math. Symp., Valparaiso, 1980, Lecture Notes in Pure and Appl. Math., vol. 96 (1985) 147-158.
6. R.E. Giudici and R.M. Vinke, A table of chromatic polynomials, J. Combin. Inform. and System Sci. 5 (1980) 323-350.
7. R.C. Read, An introduction to chromatic polynomials, J. Combin. Theory 4 (1968) 52-71.
8. R.C. Read, Connectivity and chromatic uniqueness, Ars Combin. 23 (1987) 209-218.
9. E.G. Whitehead Jr. and L.-C. Zhao, Cutpoints and chromatic polynomials, J. Graph Theory 8 (1984) 371-377.