Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (Q1701101)
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: Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs |
scientific article |
Statements
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (English)
0 references
22 February 2018
0 references
semi-equitable coloring
0 references
equitable coloring
0 references
cubic graphs
0 references
subcubic graphs
0 references
0 references
0 references
