On parsimonious edge-colouring of graphs with maximum degree three (Q2376086)
From MaRDI portal
!
WARNING
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 6181320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On parsimonious edge-colouring of graphs with maximum degree three |
scientific article; zbMATH DE number 6181320 |
Statements
On parsimonious edge-colouring of graphs with maximum degree three (English)
0 references
26 June 2013
0 references
cubic graph
0 references
edge-colouring
0 references
0.8466103672981262
0 references
0.7955323457717896
0 references
0.7883599400520325
0 references
0.7839914560317993
0 references
0.7832099199295044
0 references
