Colouring square-free graphs without long induced paths (Q3304134)
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 7228426
| 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 7228426 |
Statements
5 August 2020
0 references
graph colouring
0 references
hereditary graph class
0 references
clique-width
0 references
cycle
0 references
path
0 references
0 references
0 references
Colouring square-free graphs without long induced paths. (English)
0 references
0.9609940648078918
0 references
0.8615207672119141
0 references
0.8475990891456604
0 references
0.8412956595420837
0 references
0.8398510813713074
0 references
