An upper bound for \(D\)(2)-vertex-distinguishing proper edge chromatic numbers of graphs (Q2858198)
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 for \(D\)(2)-vertex-distinguishing proper edge chromatic numbers of graphs |
scientific article; zbMATH DE number 6229465
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for \(D\)(2)-vertex-distinguishing proper edge chromatic numbers of graphs |
scientific article; zbMATH DE number 6229465 |
Statements
19 November 2013
0 references
\(D\)(2)-vertex-distinguishing proper edge-coloring
0 references
\(D\)(2)-vertex-distinguishing proper edge chromatic number
0 references
upper bound
0 references
0.9302125
0 references
0.9284332
0 references
0.9281923
0 references
An upper bound for \(D\)(2)-vertex-distinguishing proper edge chromatic numbers of graphs (English)
0 references
