Two invariants for adjointly equivalent graphs

Australasian Journal of Combinatorics

Volumn 25, Issue , 2002, Pages 133-143

  Dong, F M ^a   Teo, K L ^b   Little, C H C ^b   Hendy, M D ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b MASSEY UNIVERSITY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 18544387561     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. Q.Y. Du, Chromaticity of the complements of paths and cycles, Discrete Math. 162 (1996), 109-125.
2. E.J. Farrell, The impact of F-polynomials in graph theory, Annals of Discrete Mathematics 55, (1993), 173-178.
3. Z.Y. Guo and Y.J. Li, Chromatic uniqueness of complement of the cycles union, Kexue Tongbao 33 (1988), 1676.
4. K.M. Koh and K.L. Teo, The search for chromatically unique graphs, Graphs and Combinatorics 6 (1990), 259-285.
5. K.M. Koh and K.L. Teo, The search for chromatically unique graphs-II, Discrete Math. 172 (1997), 59-78.
6. R.Y. Liu, A new method to find chromatic polynomials of graphs and its applications, Kexue Tongbao 32 (1987), 1508-1509.
7. t), J. Systems Sci. Math. Sci. 12 (1992), 207-214 (Chinese with English summary).
8. R.Y. Liu, Chromatic uniqueness of complement of the irreducible cycles union, Math. Appl. 7 (1994), 200-205.
9. R.Y. Liu, Adjoint polynomials and chromatically unique graphs, Discrete Math. 172 (1997), 85-92.
10. R.Y. Liu and X.W. Bao, Chromatic uniqueness of the complements of 2-regular graphs, Pure Appl. Math. Suppl 9 (1993), 69-71.
11. R.Y. Liu and J.F. Wang, On chromatic uniqueness of complement of union of cycles and paths, Theoret. Comput. Sci. 1 (1992), 112-126.
12. R.Y. Liu and L.C. Zhao, A new method for proving chromatic uniqueness of graphs, Discrete Math. 171 (1997), 169-177.
13. R.C. Read and W.T. Tutte, Chromatic polynomials, in: Selected Topics in Graph Theory III (eds. L.W. Beineke and R.J. Wilson), Academic Press, New York (1988), 15-42.