On the chromatic uniqueness of edge-gluing of complete bipartite graphs and cycles

Ars Combinatoria

Volumn 60, Issue , 2001, Pages 193-199

  Chia, G L ^a   Ho, Chee Kit ^a  

^a UNIVERSITY OF MALAYA   (Malaysia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040028614     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. N.L. Biggs, Algebraic Graph Theory, Cambrige University Press, London, New York (1994) (Second Edition).
2. C.Y. Chao and E.G. Whitehead Jr., On chromatic equivalence of graphs, Theory and Applications of Graphs, Lecture Notes in Math 642 Springer, Berlin (1978) 121-131.
3. C.Y. Chao and L.-C. Zhao, Chromatic polynomials of connected graphs, Arch. Math. (Basel) 43 (1984) 187-192.
4. G.L. Chia, A note on chromatic uniqueness of graphs, J. Graph Theory 10 (1986) 541-543.
5. G.L. Chia, Some remarks on the chromatic uniqueness of graphs, Ars Combinat. 26A (1988) 65-72.
6. G.L. Chia, On the chromatic uniqueness of graphs with connectivity two, Malaysien J. Science 16B (1995) 61-65.
7. G.L. Chia, Some problems on chromatic polynomials, Discrete Math 172 (1997) 39-44.
8. E.J. Farrell, On chromatic coefficients, Discrete Math. 29 (1980) 257-264.
9. K.M. Koh and K.L. Teo, The search for chromatically unique graphs, Graphs and Combin. 6 (1990) 259-285.
10. B. Loerinc, Chromatic uniqueness of the generalized θ-graphs, Discrete Math. 23 (1978) 313-316.
11. R.C. Read, Connectivity and chromatic uniqueness, Ars Combinat. 23 (1987) 209-218.
12. S.-J. Xu, J.J. Liu and Y.H. Peng, The chromaticity of s-bridge graphs and related graphs, Discrete Math. 135 (1994) 349-358.