The graph tessellation cover number: extremal bounds, efficient algorithms and hardness (Q2294676)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The graph tessellation cover number: extremal bounds, efficient algorithms and hardness |
scientific article |
Statements
The graph tessellation cover number: extremal bounds, efficient algorithms and hardness (English)
0 references
12 February 2020
0 references
staggered quantum walk
0 references
clique graph
0 references
tessellation
0 references
