Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs
From MaRDI portal
Publication:1356650
DOI10.1016/0012-365X(95)00301-CzbMath0870.05026MaRDI QIDQ1356650
Marietjie Frick, Izak Broere, Gerhard Benadé, Betsie Jonck
Publication date: 7 July 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
chromatic number; Hamilton path; uniquely colourable graphs; longest path; path number; colourable graph; colour classes
05C38: Paths and cycles
05C15: Coloring of graphs and hypergraphs
05C45: Eulerian and Hamiltonian graphs
Related Items
Cites Work