Uniquely Line Colorable Graphs
D. L. Greenwell, Hudson V. Kronk · Canadian Mathematical Bulletin · 1973
A line-coloring of a graph G is an assignment of colors to the lines of G so that adjacent lines are colored differently; an n-line coloring uses n colors. The line-chromatic number χ'(G) is the smallest n for which G admits an n-line coloring.