Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth (Q4238167)
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: Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth |
scientific article; zbMATH DE number 1275750
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth |
scientific article; zbMATH DE number 1275750 |
Statements
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth (English)
0 references
13 April 1999
0 references
chromatic number
0 references
\(k\)-colourable graph
0 references
girth
0 references
polynomial time algorithm
0 references
