An upper bound on the distinguishing index of graphs with minimum degree at least two (Q4969593)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An upper bound on the distinguishing index of graphs with minimum degree at least two |
scientific article; zbMATH DE number 7260093
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound on the distinguishing index of graphs with minimum degree at least two |
scientific article; zbMATH DE number 7260093 |
Statements
13 October 2020
0 references
distinguishing index
0 references
edge-colourings
0 references
upper bound
0 references
math.CO
0 references
0.8804168105125427
0 references
0.8728705644607544
0 references
0.8658727407455444
0 references
0.8601200580596924
0 references
0.8513085246086121
0 references
