Graph Subcolorings: Complexity and Algorithms (Q4443116): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56428503, #quickstatements; #temporary_batch_1711439739529 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0895480101395245 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978588354 / rank | |||
Normal rank | |||
Latest revision as of 10:11, 30 July 2024
scientific article; zbMATH DE number 2024394
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph Subcolorings: Complexity and Algorithms |
scientific article; zbMATH DE number 2024394 |
Statements
Graph Subcolorings: Complexity and Algorithms (English)
0 references
8 January 2004
0 references
graph subcoloring
0 references
computational complexity
0 references
cograph
0 references
cliquewidth
0 references
treewidth
0 references
