On the join of graphs and chromatic uniqueness. (English) Zbl 0819.05027

Chia, G. L.

J. Graph Theory 19, No. 2, 251-261 (1995).

Let \(U_{n+1}\) denote the graph obtained from the wheel \(K_ 1+ C_ n\) by deleting a spoke, where \(+\) denotes the join of graphs. The author shows that, for any \(m\geq 1\) and odd \(n\geq 3\), the graph \(K_ m+ U_{n+1}\) is chromatically unique.

Reviewer: J.Fiamčik (Prešov)

MSC:

05C15

Coloring of graphs and hypergraphs

Keywords:

chromatic uniqueness; chromatic polynomial; complete graph; cycle; wheel; join of graphs; chromatically unique

References:

[1]	Chao, J. Graph Theory 10 pp 129– (1986)
[2]	Chao, Discrete Math. 41 pp 139– (1982)
[3]	and , On chromatic equivalence of graphs. Theory and Applications of Graphs, Lecture Notes in Mathematics, Vol. 642. Springer, Berlin (1978) 121–131.
[4]	Chao, Discrete Math. 27 pp 171– (1979)
[5]	Chia, J. Graph Theory 10 pp 541– (1986)
[6]	Chia, Ars Combinat. 26A pp 65– (1988)
[7]	Chia, Discrete Math. 82 pp 209– (1990)
[8]	Chia, Scientia Ser. A 2 pp 27– (1988)
[9]	Dong, J. Math Res. Expo. 10 pp 447– (1990)
[10]	Farrell, Discrete Math. 29 pp 257– (1980)
[11]	Farrell, J. Combin. Math. Combin. Comput. 8 pp 79– (1990)
[12]	Giudici, Lecture Notes Pure Appl. Math. 96 pp 147– (1985)
[13]	Graph Theory. Addison-Wesley, Reading, MA (1969).
[14]	Koh, Graphs Combinat. 6 pp 259– (1990)
[15]	Li, J. Xinjiang Univ. Natur. Sci. 7 pp 95– (1990)
[16]	Loerinc, J. Combinat. Theory Ser. B 31 pp 54– (1981)
[17]	Read, J. Combinat. Theory 4 pp 52– (1968)
[18]	Read, Ars Combinat. 23 pp 209– (1987)
[19]	Read, Discrete Math. 69 pp 317– (1988)
[20]	Salzberg, Discrete Math. 58 pp 285– (1986)
[21]	Teo, J. Graph Theory 14 pp 89– (1990)
[22]	Whitehead, J. Graph Theory 8 pp 371– (1984)
[23]	Xu, J. Shanghai Teach. Univ. Nat. Sci. Ed. 2 pp 10– (1987)
[24]	Xu, Discrete Math. 51 pp 207– (1984)