Closing Complexity Gaps for Coloring Problems on H-Free Graphs (Q4909517): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2151059773 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:35, 19 March 2024
scientific article; zbMATH DE number 6147787
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Closing Complexity Gaps for Coloring Problems on H-Free Graphs |
scientific article; zbMATH DE number 6147787 |
Statements
Closing Complexity Gaps for Coloring Problems on H-Free Graphs (English)
0 references
21 March 2013
0 references
