On the order of uniquely (k,m)-colourable graphs
From MaRDI portal
(Redirected from Publication:923092)
Recommendations
Cites work
- scientific article; zbMATH DE number 3166040 (Why is no real title available?)
- scientific article; zbMATH DE number 4043873 (Why is no real title available?)
- scientific article; zbMATH DE number 3625415 (Why is no real title available?)
- scientific article; zbMATH DE number 867685 (Why is no real title available?)
- A Theorem on k-Saturated Graphs
- Some covering concepts in graphs
- Uniquely colorable graphs
Cited in
(10)- Uniquely colourable m-dichromatic oriented graphs
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
- On uniquely 3-colorable graphs
- TWO RESULTS ON GENERALIZED CHROMATIC NUMBERS
- scientific article; zbMATH DE number 4099329 (Why is no real title available?)
- ON UNIQUELY -G k-COLOURABLE GRAPHS
- scientific article; zbMATH DE number 4043873 (Why is no real title available?)
- scientific article; zbMATH DE number 3855144 (Why is no real title available?)
- On uniquely partitionable planar graphs
- Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs
This page was built for publication: On the order of uniquely (k,m)-colourable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q923092)