Chromatically unique multibridge graphs

Electronic Journal of Combinatorics

Volumn 11, Issue 1 R, 2004, Pages

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

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b MASSEY UNIVERSITY   (New Zealand)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Chromatic polynomials; Polygon tree; closed; unique

Indexed keywords

EID: 3042575688     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1765     Document Type: Article

References (16)

1. C.Y. Chao and L.C. Zhao, Chromatic polynomials of a family of graphs, Ars. Combin. 15 (1983) 111-129.
2. X.E. Chen, X.W. Bao and K.Z. Ouyang, Chromaticity of the graph θ(a, b, c, d), J. Shaanxi Normal Univ. 20 (1992) 75-79.
3. G.A. Dirac, A property of 4-chromatic graphs and some results on critical graphs, J. London Math. Soc. 27 (1952) 85-92.
4. F.M. Dong, On chromatic uniqueness of two infinite families of graphs, J. Graph Theory 17 (1993) 387-392.
5. R.J. Duffin, Topology of series-parallel networks, J. Math. Anal. Appl. 10 (1965) 303-318.
6. K.M. Koh and C.P. Teo, Some results on chromatically unique graphs, Proc. Asian Math. Conf. (World Scientific, Singapore, 1990) 258-262.
7. K.M. Koh and C.P. Teo, Chromaticity of series-parallel graphs, Discrete Math. 154 (1996) 289-295.
8. K.M. Koh and K.L. Teo, The search for chromatically unique graphs, Graphs and Combinatorics 6 (1990) 259-285.
9. K.M. Koh and K.L. Teo, The search for chromatically unique graphs -II, Discrete Math. 172 (1997) 59-78.
10. B. Loerinc, Chromatic uniqueness of the generalized θ-graphs, Discrete Math. 23 (1978) 313-316.
11. Y.H. Peng, On the chromatic coefficients of a graph and chromatic uniqueness of certain n-partition graphs, in: Combinatorics, Graph Theory, Algorithms and Applications (Beijing, 1993) (World Scientific, River Edge, NJ, 1994) 307-316.
12. C.D. Wakelin and D.R. Woodall, Chromatic polynomials, polygon trees and outerplanar graphs, J. Graph Theory 16 (1992) 459-466.
13. S.J. Xu, Classes of chromatically equivalent graphs and polygon trees, Discrete Math. 133 (1994) 267-278.
14. 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.
15. A.A. Zykov, On some properties of linear complexes, Amer. Math. Soc. Transl. No. 79 (1952); translated from Math. Sb. 24(66) (1949) 163-188.
16. A.A. Zykov, On some properties of linear complexes, Amer. Math. Soc. Transl. No. 79 (1952); translated from Math. Sb. 24(66) (1949) 163-188.