On the hardness of computing span of subcubic graphs (Q888955)
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: On the hardness of computing span of subcubic graphs |
scientific article; zbMATH DE number 6504971
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of computing span of subcubic graphs |
scientific article; zbMATH DE number 6504971 |
Statements
On the hardness of computing span of subcubic graphs (English)
0 references
5 November 2015
0 references
subcubic graphs
0 references
span
0 references
vertex coloring
0 references
computational complexity
0 references
