Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (Q1701101): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2017.12.002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2017.12.002 / rank | |||
Normal rank | |||
Latest revision as of 04:39, 11 December 2024
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
