Uniquely N-colorable and Chromatically Equivalent Graphs
Chong-Yun Chao · 2001
For each integer we present a uniquely n-colorable graph with , 3 t n 1 2 � n vertices, and their generalizations. For each integer we present two uniquely , 3 t n colorable - ) 1 ( � n graphs which are chromatically equivalent with vertices, and with 2 2 � n 3 2 � n vertices, and their generalizations.