Three-colourability and forbidden subgraphs. II: Polynomial algorithms (Q1613477)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1792407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three-colourability and forbidden subgraphs. II: Polynomial algorithms |
scientific article; zbMATH DE number 1792407 |
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
0.9019820690155028
0 references
0.8908300995826721
0 references
0.8891437649726868
0 references
0.8403019309043884
0 references
0.8396034836769104
0 references
