Construction of uniquely vertex k-colorable graphs with minimum possible size (Q5456311)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Construction of uniquely vertex k-colorable graphs with minimum possible size |
scientific article; zbMATH DE number 5260884
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Construction of uniquely vertex k-colorable graphs with minimum possible size |
scientific article; zbMATH DE number 5260884 |
Statements
Construction of uniquely vertex k-colorable graphs with minimum possible size (English)
0 references
4 April 2008
0 references
\(k\)-colorable
0 references
uniquely vertex \(k\)-colorable graphs
0 references
0.9280426
0 references
0.9188821
0 references
0.9154503
0 references
0 references
0 references
0.90267843
0 references
0.8965382
0 references
