On uniquely 3-colorable graphs
The authors show: (1) For each integer \(m\geq 12\), there exists a uniquely 3-colourable graph of order \(m\) without triangles. (2) For each integer \(n\geq 3\), there exists infinitely many uniquely \(n\)-colourable regular graphs having no subgraph isomorphic to the complete graph \(K_ n\) on \(n\) vertices.
scientific article; zbMATH DE number 179585