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 the normal view instead:
scientific article; zbMATH DE number 6842198
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs |
scientific article; zbMATH DE number 6842198 |
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
0.8437173366546631
0 references
0.823752224445343
0 references
0.7810146808624268
0 references
0.7792930006980896
0 references
0.7772958278656006
0 references
