The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645)
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: The vertex colourability problem for \claw, butterfly\-free graphs is polynomial-time solvable |
scientific article; zbMATH DE number 7343952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable |
scientific article; zbMATH DE number 7343952 |
Statements
The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (English)
0 references
5 May 2021
0 references
vertex colourability problem
0 references
computational complexity
0 references
hereditary graph class
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8557547330856323
0 references
0.8357416391372681
0 references
0.8317736387252808
0 references
0.8249999284744263
0 references
