An improved upper bound on the adjacent vertex distinguishing edge chromatic number of a simple graph. (Q3190875)
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 6346412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved upper bound on the adjacent vertex distinguishing edge chromatic number of a simple graph. |
scientific article; zbMATH DE number 6346412 |
Statements
19 September 2014
0 references
Chernoff bound
0 references
adjacent vertex distinguishing edge coloring
0 references
vertex distinguishing edge coloring
0 references
adjacent strong edge coloring
0 references
strong edge coloring
0 references
0.9035147428512572
0 references
0.8987783789634705
0 references
0.8948782682418823
0 references
0.8926989436149597
0 references
0.8911879062652588
0 references
