Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs

DOI10.1016/0012-365X(95)00301-CzbMath0870.05026OpenAlexW2770404470MaRDI QIDQ1356650

Betsie Jonck, Gerhard Benadé, Marietjie Frick, Izak Broere

Publication date: 7 July 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00301-c

zbMATH Keywords

chromatic numberHamilton pathuniquely colourable graphslongest pathpath numbercolourable graphcolour classes

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable ⋮ Unnamed Item

Cites Work

• On the order of uniquely (k,m)-colourable graphs
• Saturated graphs with minimal number of edges
• A Problem in Graph Theory
• Uniquely colorable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs