Colouring square-free graphs without long induced paths (Q2323345)
From MaRDI portal
!
WARNING
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 7100314
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Colouring square-free graphs without long induced paths |
scientific article; zbMATH DE number 7100314 |
Statements
Colouring square-free graphs without long induced paths (English)
0 references
30 August 2019
0 references
graph colouring
0 references
forbidden induced subgraphs
0 references
clique-width
0 references
atoms
0 references
0 references
0 references
0 references
0 references
0.9609940648078918
0 references
0.8564449548721313
0 references
0.8472623825073242
0 references
0.842807412147522
0 references
0.8419268131256104
0 references
