On the order of uniquely (k,m)-colourable graphs

DOI10.1016/0012-365X(90)90200-2zbMath0712.05024OpenAlexW1966409080MaRDI QIDQ923092

Marietjie Frick, Izak Broere

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90200-2

zbMATH Keywords

m-admissible colouringuniquely (k,m)-colourable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs ⋮ Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable ⋮ On uniquely partitionable planar graphs

Cites Work

• A Theorem on k-Saturated Graphs
• Uniquely colorable graphs
• Some covering concepts in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the order of uniquely (k,m)-colourable graphs