On σ-Equivalence and χ-Equivalence of Graphs

Journal of Graph Theory

Volumn 21, Issue 2, 1996, Pages 211-217

  Du, Qingyan ^a  

^a INNER MONGOLIA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1842577449     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199602)21:2<211::AID-JGT11>3.0.CO;2-M     Document Type: Article

References (10)

1. G. D. Birkhoff and D. C. Lewis, Chromatic polynomials, Trans. Amer. Math. Soc. 60 (1994), 355-451.
2. G. Chartrand and L. Lesniak, Graphs and Digraphs, Wadsworth, Belmont, California (1986).
3. Q. Du, On σ-polynomials and a class of chromatically unique graph. Discrete Math. 115 (1993), 153-156.
4. Q. Du, A new upper bounds for the coefficients of σ-polynomials, Acta. Sci. Natur. Univ. Neimenggu 25 (1994), 14-16.
5. Q. Du, Chromaticity of the complements of paths and cycles, Discrete Math. to appear.
6. R. R. Korfhage, σ-polynomials and graph coloring, J. Combin. Theory Ser. B 24 (1978), 137-153.
7. B. Loerinc and Jr. E. J. Whitehead, Chromatic polynomials for regular graphs and modified wheels, J. Comb. Theory Ser. B 31 (1981), 54-61.
8. 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.
9. C. P. Teo and K.M. Koh, The number of shortest cycles and chromatic uniqueness of a graph, J. Graph Theory 16 (1992), 7-15.
10. Shao-Ji Xu, On σ-polynomials, Discrete Math. 69 (1988), 189-194.