On the complexity of 4-coloring graphs without long induced paths (Q2465649): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 08:13, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of 4-coloring graphs without long induced paths |
scientific article |
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
