Bounds and complexity results for strong edge colouring of subcubic graphs (Q2857388)
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 6222049
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds and complexity results for strong edge colouring of subcubic graphs |
scientific article; zbMATH DE number 6222049 |
Statements
1 November 2013
0 references
Bounds and complexity results for strong edge colouring of subcubic graphs (English)
0 references
0.9333910346031188
0 references
0.9215505719184875
0 references
0.8829613327980042
0 references
0.8780413866043091
0 references
0.8694587349891663
0 references
