Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation (Q5405060)
From MaRDI portal
scientific article; zbMATH DE number 7055347
- Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation |
scientific article; zbMATH DE number 7055347 |
|
Statements
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation (English)
0 references
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More (English)
0 references
31 March 2014
0 references
15 May 2019
0 references
