Equitable coloring of corona products of cubic graphs is harder than ordinary coloring (Q2827784)
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: Equitable coloring of corona products of cubic graphs is harder than ordinary coloring |
scientific article; zbMATH DE number 6641989
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equitable coloring of corona products of cubic graphs is harder than ordinary coloring |
scientific article; zbMATH DE number 6641989 |
Statements
Equitable coloring of corona products of cubic graphs is harder than ordinary coloring (English)
0 references
21 October 2016
0 references
corona graph
0 references
cubic graph
0 references
equitable chromatic number
0 references
equitable graph coloring
0 references
NP-hardness
0 references
polynomial algorithm
0 references
0.9432446
0 references
0.93397105
0 references
0.9248602
0 references
0.91304153
0 references
0.90975034
0 references
0.8846383
0 references
0.87982744
0 references
0.8796175
0 references
0 references
0.87868184
0 references
