Colouring vertices of triangle-free graphs without forests (Q764907)
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: Colouring vertices of triangle-free graphs without forests |
scientific article; zbMATH DE number 6015231
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Colouring vertices of triangle-free graphs without forests |
scientific article; zbMATH DE number 6015231 |
Statements
Colouring vertices of triangle-free graphs without forests (English)
0 references
16 March 2012
0 references
vertex colouring
0 references
triangle-free graphs
0 references
polynomial-time algorithm
0 references
clique-width
0 references
0.9546741843223572
0 references
0.8513394594192505
0 references
0.8479418754577637
0 references
0.8451522588729858
0 references
0.8331617712974548
0 references
