an:00370424
Zbl 0777.05059
Dong, Feng-Ming
On chromatic uniqueness of two infinite families of graphs
EN
J. Graph Theory 17, No. 3, 387-392 (1993).
00014477
1993
j
05C15
chromatic uniqueness
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.
Liu Yanpei (Beijing)