Clustered colouring of graph classes with bounded treedepth or pathwidth (Q5885188)
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 7671451
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clustered colouring of graph classes with bounded treedepth or pathwidth |
scientific article; zbMATH DE number 7671451 |
Statements
Clustered colouring of graph classes with bounded treedepth or pathwidth (English)
0 references
3 April 2023
0 references
graph colouring
0 references
clustered colouring
0 references
minor
0 references
treedepth
0 references
pathwidth
0 references
fractional colouring
0 references
0.9058467745780944
0 references
0.790152370929718
0 references
0.7896588444709778
0 references
0.7756334543228149
0 references
0.7684345245361328
0 references
