Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (Q1701101): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2962902234 / rank | |||
Normal rank | |||
Revision as of 21:40, 19 March 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
