Chromaticity of series-parallel graphs

Discrete Mathematics

Volumn 154, Issue 1-3, 1996, Pages 289-295

  Koh, K M ^b   Teo, C P ^a  

^a Operations Research Center   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042536788     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(94)00355-M     Document Type: Article

References (13)

1. C.Y. Chao and N.Z. Li, On trees of polygons, Arch. Math. 45 (1985) 180-185.
2. C.Y. Chao and E.G. Whitehead Jr., On chromatic equivalence of graphs, Lecture Notes in Math., Vol. 642 (Springer, Berlin, 1978) 121-131.
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. R.J. Duffin, Topology of series-parallel networks, J. Math. Analy. Appl. 10 (1965) 303-318.
5. K.M. Koh and K.L. Teo, The search for chromatically unique graphs, Graphs Combin. 6 (1990) 259-285.
6. K.M. Koh and C.P. Teo, Some results on chromatically unique graphs, Proc. Asian Math. Conf. (1990) 258-262.
7. B. Loerinc, Chromatic uniqueness of the generalised Θ-graph, Discrete Math. 23 (1978) 313-316.
8. R.C. Read, An introduction to chromatic polynomials, J. Combin. Theory 4 (1968) 52-71.
9. R.C. Read and W.T. Tutte, Chromatic polynomials, in: Selected Topics in Graph Theory, Vol. 3, (Academic Press, New York, 1988) 15-42.
10. C.D. Wakelin and D.R. Woodall, Chromatic polynomials, polygon trees, and outerplanar graphs, J. Graph Theory 16 (1992) 459-466.
11. E.G. Whitehead Jr., Chromatic polynomials of generalized trees, Discrete Math. 72 (1988) 391-393.
12. S.J. Xu, Classes of chromatically equivalent graphs and polygon trees, Discrete Math., to appear.
13. S.J. Xu and J.J. Liu, The chromaticity of s-bridge graphs and related graphs, submitted.