Three-colourability and forbidden subgraphs. II: Polynomial algorithms (Q1613477): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q55920244, #quickstatements; #temporary_batch_1706515227281 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q55920244 / rank | |||
Normal rank | |||
Revision as of 10:07, 29 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three-colourability and forbidden subgraphs. II: Polynomial algorithms |
scientific article |
Statements
Three-colourability and forbidden subgraphs. II: Polynomial algorithms (English)
0 references
29 August 2002
0 references
colouring algorithms
0 references
chromatic number
0 references
forbidden induced subgraphs
0 references
3-colourability
0 references
graph class
0 references
