Chromatic classes of 2-connected (n,n+4)-graphs with at least four triangles

Discrete Mathematics

Volumn 278, Issue 1-3, 2004, Pages 209-218

  Peng, Y H ^a   Lau, G C ^b  

^a UNIVERSITY PUTRA MALAYSIA   (Malaysia)

^b TUNKU ABDUL RAHMAN UNIVERSITY COLLEGE   (Malaysia)

Author keywords

Chromatic polynomial; Chromatically equivalent; Chromatically unique

Indexed keywords

MATHEMATICAL MODELS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

CHROMATIC POLYNOMIALS; CHROMATICALLY EQUIVALENT; CHROMATICALLY UNIQUE;

GRAPH THEORY;

EID: 1142263901     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2003.05.003     Document Type: Article

References (18)

1. Chao C.Y., Whitehead E.G. Jr. On chromatic equivalence of graphs. Alavi Y., Lick D.R. Theory and Applications of Graph. Springer Lecture Notes in Math. Vol. 642:1978;121-131 Springer, Berlin, New York.
2. Chao C.Y., Whitehead E.G. Jr. Chromatically unique graphs. Discrete Math. 27:1979;171-177.
3. Dong F.M., Teo K.L., Teo K.M. A note on the chromaticity of some 2-connected. (n,n+3) -graphs Discrete Math. 243:2002;217-221.
4. Farrell G.J. On chromatic coefficients. Discrete Math. 29:1980;257-264.
5. Koh K.M., Goh B.H. Two classes of chromatically unique graphs. Discrete Math. 82:1990;13-24.
6. Koh K.M., Teo C.P. The chromatic uniqueness of certain broken wheels. Discrete Math. 96:1991;65-69.
7. Koh K.M., Teo K.L. Chromatic classes of 2-connected. (n,n+3) -graphs with at least two triangles Discrete Math. 127:1994;243-258.
8. 4 -homeomorph is chromatically unique Ars Combin. 23:1987;13-36.
9. Loerinc B. Chromatic uniqueness of the generalized. θ -graphs Discrete Math. 23:1978;313-316.
10. Y.H. Peng, G.C. Lau, Chromatic classes of two families of 2-connected (n,n+3) -graphs, Departmental Research Report, Universiti Putra Malaysia, 2002, 17p.
11. Read R.C. An introduction to chromatic polynomials. J. Combin. Theory. 4:1968;52-71.
12. Read R.C., Whitehead E.G. Jr. Chromatic polynomials of homeomorphism classes of graphs. Discrete Math. 204:1999;337-356.
13. Teo K.L., Koh K.M. Chromatic classes of certain 2-connected. (n, n+2) -graphs Ars Combin. 32:1991;65-76.
14. Whitehead E.G. Jr., Zhao L.C. Cutpoints and the chromatic polynomial. J. Graph Theory. 8:1984;371-377.
15. Whitney H. The coloring of graphs. Ann. Math. 33:1932;688-718.
16. Zykov A.A. On some properties of linear complexes. Amer. Math. Soc. Transl. 79:1952;. (translated from Math. Sb. 24(66) (1949) 163-188).
17. Zykov A.A. On some properties of linear complexes. Amer. Math. Soc. Transl. 79:1952;. (translated from Math. Sb. 24(66) (1949) 163-188).
18. http://www.fsas.upm.edu.my/̃yhpeng/publish/reportlgc1.pdf .