Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (Q1401202): Difference between revisions
From MaRDI portal
Revision as of 09:47, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. |
scientific article |
Statements
Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (English)
0 references
17 August 2003
0 references
\(H\)-colourable subgraphs
0 references