On the complexity of 4-coloring graphs without long induced paths (Q2465649): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.09.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2160153943 / rank | |||
Normal rank | |||
Revision as of 21:19, 19 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
