Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » By Affiliations
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top 20 Journal Cited
 » Top 20 Cited
 » Top 20 Author Cited
 » Usage Since Sept 2007


 
 
 

Login | Create Account

On the Chromatic Uniqueness of Edge-Gluing of Complete Tripartite Graphs and Cycles

Chia, G.L., and Ho, C.K., (2003) On the Chromatic Uniqueness of Edge-Gluing of Complete Tripartite Graphs and Cycles. Bulletin of the Malaysian Mathematical Sciences Society, 26 (1). pp. 87-92. ISSN 0126-6705

Full text not available from this repository.

Official URL: http://math.usm.my/bulletin/pdf/v26n1/v26n1p9.pdf

Affiliations

Universiti Malaya, Institute of Mathematical Sciences

Abstract

In this paper, it is shown that the graph obtained by overlapping the cycle $C_m (m \geq 3)$ and the complete tripartite graph $K_2,_2,_2$ at an edge is uniquely determined by its chromatic polynomial.

Item Type:Journal
Subjects:Q Science, Computer Science
ID Code:1295

1. N.L. Biggs, Algebraic Graph Theory, Cambridge University Press, London, New York (Second Edition), 1994.

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. Chia, G.L. A note on chromatic uniqueness of graphs, J. Graph Theory 10 (1986), 541—543.

4. Chia, G.L. On the chromatic uniqueness of graphs with connectivity two, Malaysian J. Science 16B (1995), 61—65.

5. Chia, G.L. Some problems on chromatic polynomials, Discrete Math. 172 (1997), 39—44.

6. Chia, G.L. and Ho, C.K. On the chromatic uniqueness of edge-gluing of complete bipartite graphs and cycles, Ars Combinat. 60(2001), 193—199.

7. E.J. Farrell, On chromatic coefficients, Discrete Math. 29 (1980), 257—264.

8. R.E. Giudici, Some new families of chromatically unique graphs, Analysis, Geomery, and Probability, Lecture Notes in Pure and Appl. Math, 96 Dekker, New York (1985), 147—158.

9. Koh, K.M. and Goh, B.H. Two classes of chromatically unique graphs, Discrete Math. 82 (1990), 13—24.

10. Koh, K.M. and Teo, K.L. The search for chromatically unique graphs, Graphs and Combin. 6 (1990), 259—285.

11. Li, N.Z. The list of chromatically unique graphs of order seven and eight, Discrete Math. 172 (1997), 193—221.

12. R.C. Read, Broken wheels are SLC, Ars Combinat. 21A (1986), 123—128.

13. R.C. Read, Connectivity and chromatic uniqueness, Ars Combinat. 23 (1987), 209—218.

14. E.G. Whitehead Jr. and L.-C. Zhao, Cutpoints and the chromatic polynomial, J. Graph Theory 8 (1984), 371—377.

15. S.-J. Xu, Some notes on chromatic uniqueness of graphs, (Chinese, English summary), J. Shanghai Teach. Univ., Nat. Sci. Ed. 2 (1987), 10—12.

16. 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.

Repository Staff Only: item control page
 
 
 
 
 
   
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.