One the upper bound of the \(D\)(2)-vertex-distinguishing chromatic numbers of graphs (Q3054071)
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 5811104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One the upper bound of the \(D\)(2)-vertex-distinguishing chromatic numbers of graphs |
scientific article; zbMATH DE number 5811104 |
Statements
5 November 2010
0 references
graph
0 references
Markov inequality
0 references
the first moment principle
0 references
vertex-distinguishing proper edge-coloring
0 references
vertex-distinguishing edge-chromatic number
0 references
0.9555562734603882
0 references
0.9074687361717224
0 references
0.8929365277290344
0 references
0.8748530149459839
0 references
0.8465551137924194
0 references
