Two complexity results for the vertex coloring problem (Q505438): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710434565540 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2016.10.025 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2560576235 / rank | |||
Normal rank | |||
Revision as of 01:30, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two complexity results for the vertex coloring problem |
scientific article |
Statements
Two complexity results for the vertex coloring problem (English)
0 references
23 January 2017
0 references
computational complexity
0 references
coloring problem
0 references
hereditary class
0 references
polynomial-time algorithm
0 references
