On the complexity of 4-coloring graphs without long induced paths (Q2465649)
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 5223691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of 4-coloring graphs without long induced paths |
scientific article; zbMATH DE number 5223691 |
Statements
On the complexity of 4-coloring graphs without long induced paths (English)
0 references
7 January 2008
0 references
graph coloring
0 references
\(P_{5}\)-free graph
0 references
computational complexity
0 references
induced path
0 references
0.8662917613983154
0 references
0.8657991886138916
0 references
0.8558940887451172
0 references
0.846152126789093
0 references
0.8420113325119019
0 references
