Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (Q1401202)
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: Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. |
scientific article; zbMATH DE number 1965240
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. |
scientific article; zbMATH DE number 1965240 |
Statements
Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (English)
0 references
17 August 2003
0 references
\(H\)-colourable subgraphs
0 references
