The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness |
scientific article |
Statements
The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (English)
0 references
22 November 2019
0 references
graph tessellation cover
0 references
graph coloring
0 references
clique graph
0 references
staggered quantum walk
0 references
0 references
0 references
