The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9739687
0 references
0.93688667
0 references
0.8999164
0 references
0.88842034
0 references
0.88503337
0 references
0.8849413
0 references
0.88385653
0 references
0.8836401
0 references
0.8836401
0 references
