# zbMATH — the first resource for mathematics

On chromatic uniqueness of two infinite families of graphs. (English) Zbl 0777.05059
This paper shows that both the graphs $$\Theta_ k(m,\dots,m)$$, for $$m,k\geq 2$$, and $$K_{m,n}$$, for $$n\geq m\geq 2$$, are chromatically unique where the former is the graph formed as the edge-disjoint union of $$k$$ paths of length $$m$$ with same ends and the latter is the complete bipartite graph.

##### MSC:
 05C15 Coloring of graphs and hypergraphs
##### Keywords:
chromatic uniqueness
Full Text:
##### References:
 [1] Chao, Lecture Notes in Math. 642 pp 121– (1978) [2] Read, J. Combinat. Theory 4 pp 52– (1968) [3] Loerinc, Discrete Math. 23 pp 313– (1978) · Zbl 0389.05034 · doi:10.1016/0012-365X(78)90012-2 [4] Graph Theory with Algorithms, Vols. 1 and 2. Institute of Applied Mathematics, Academia Sinica (1981) (in Chinese). [5] Whitehead, J. Graph Theory 8 pp 371– (1984) [6] Teo, J. Graph Theory 8 pp 89– (1990) [7] Bari, J. Graph Theory 1 pp 269– (1977) [8] Whitney, Bull. Am. Math. Soc. 38 pp 572– (1932)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.