K_r-free uniquely vertex colorable graphs with minimum possible edges
From MaRDI portal
(Redirected from Publication:1850550)
\(K r\)-free uniquely vertex colorable graphs with minimum possible edges
\(K r\)-free uniquely vertex colorable graphs with minimum possible edges
Recommendations
- Construction of uniquely vertex k-colorable graphs with minimum possible size
- ON UNIQUELY -G k-COLOURABLE GRAPHS
- scientific article; zbMATH DE number 3914344
- A characterization of uniquely vertex colorable graphs using minimal defining sets
- scientific article; zbMATH DE number 4004207
- scientific article; zbMATH DE number 572161
- scientific article; zbMATH DE number 6604949
- Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs
- The existence of uniquely \(-G\) colourable graphs
- Uniquely n-colorable and chromatically equivalent graphs
Cites work
Cited in
(7)- A construction of uniquely colourable graphs with equal colour class sizes
- Algebraic characterization of uniquely vertex colorable graphs
- A relation between choosability and uniquely list colorability
- On two generalizations of the Alon-Tarsi polynomial method
- scientific article; zbMATH DE number 6604949 (Why is no real title available?)
- Construction of uniquely vertex k-colorable graphs with minimum possible size
- scientific article; zbMATH DE number 7145382 (Why is no real title available?)
This page was built for publication: \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850550)
