Some problems on chromatic polynomials

Discrete Mathematics

Volumn 172, Issue 1-3, 1997, Pages 39-44

  Chia, G L ^a  

^a UNIVERSITY OF MALAYA   (Malaysia)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (31)

1. r, s), European J. Combin. 1 (1980) 9-17.
2. N.L. Biggs, Algebraic Graph Theory (Cambridge Univ. Press, London, 1994).
3. C.Y. Chao, Z.-Y. Guo and N.-Z. Li, On q-graphs, submitted.
4. C.Y. Chao and G.A. Novacky Jr., On maximally saturated graphs, Discrete Math. 41 (1982) 139-143.
5. C.Y. Chao and E.G. Whitehead Jr., On chromatic equivalence of graphs, Theory and Applications of Graphs, Lecture Notes in Mathematics, Vol. 642 (Springer, Berlin, 1978) 121-131.
6. G.L. Chia, A note on chromatic uniqueness of graphs, J. Graph Theory 10 (1986) 541-543.
7. G.L. Chia, Some remarks on the chromatic uniqueness of graphs, Ars Combin. 26A (1988) 65-72.
8. G.L. Chia, On the join of graphs and chromatic uniqueness, J. Graph Theory 19 (1995) 251-261.
9. F.M. Dong, On the uniqueness of chromatic polynomial of generalized wheel graph, J. Math. Res. Exposition 10 (1990) 447-454 (Chinese, English summary).
10. F.M. Dong, The chromatic uniqueness of two special graphs, Acta Math. Sinica 34 (1991) 242-251 (Chinese).
11. Q.Y. Du, Chromatic polynomials of triangulated graphs, Nei Mongol Daxue Xuebao Ziran Kexue 23 (1992) 148-151 (Chinese, English summary).
12. E.J. Farrell and E.G. Whitehead Jr., On matching and chromatic properties of circulants, J. Combin. Math. Combin. Comput. 8 (1990) 79-88.
13. R.E. Giudici, Some families of chromatically unique graphs, in: Proc. First Chilean Math. Symp. (Valparaiso, 1980) Lecture Notes in Pure and Applied Math. Vol. 96 (1985) 147-158.
14. R.E. Giudici and R.M. Vinkle, A table of chromatic polynomials, J. Combin. Inform. System Sci. 5 (1980) 323-350.
15. F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1969).
16. K.M. Koh and B.H. Goh, Two classes of chromatically unique graphs, Discrete Math. 82 (1990) 13-24.
17. K.M. Koh and K.L. Teo, The search for chromatically unique graphs, Graphs Combin. 6 (1990) 259-285.
18. t), J. Systems Sci. Math. Sci. 12 (1992) 207-214 (Chinese, English summary).
19. R.Y. Liu and X.-W. Bao, Chromatic uniqueness of complements of 2-regular graphs, Pure Appl. Math. Supplements (2) 9 (1993) 69-71.
20. R.Y. Liu and N.Z. Li, Chromatic uniqueness of connected vertex-transitive graphs, Math. Appl. 4 (1991) 50-53 (Chinese, English summary).
21. n - E(G), J. Math. (Wuhan), (Chinese), to appear.
22. B. Loerinc and E.G. Whitehead Jr., Chromatic polynomials for regular graphs and modified wheels, J. Combin. Theory Ser. B 31 (1981) 54-61.
23. R.C. Read, An introduction to chromatic polynomials, J. Combin. Theory 4 (1968) 52-71.
24. R.C. Read, Connectivity and chromatic uniqueness, Ars Combin. 23 (1987) 209-218.
25. R.C. Read, On the chromatic properties of graphs up to 10 vertices, Congr. Numer. 59 (1987) 243-255.
26. C.P. Teo and K.M. Koh, The chromaticity of complete bipartite graphs with at most one edge deleted, J. Graph Theory 14 (1990) 89-99.
27. P. Vaderlind, Chromaticity of triangulated graphs, J. Graph Theory 12 (1988) 245-248.
28. T. Wanner, On the chromaticity of certain subgraphs of a q-tree, J. Graph Theory 13 (1989) 597-605.
29. E.G. Whitehead Jr. and L.-C. Zhao, Outpoints and the chromatic polynomial, J. Graph Theory 8 (1984) 371-377.
30. D.R. Woodall, Zeros of chromatic polynomials, in: P.J. Cameron, ed., Combinatorial Survey, Proc. Sixth British Combinat. Conf. (Academic Press, New York, 1977) 199-223.
31. S.-J. Xu, Some notes on chromatic uniqueness of graphs, J. Shanghai Teach. Univ., Nat. Sci. Ed. 2 (1987) 10-12 (Chinese, English summary).