One upper bound on the \(D(2)\)-vertex-distinguishing chromatic numbers of graphs (Q3403632)
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: One upper bound on the D(2)-vertex-distinguishing chromatic numbers of graphs |
scientific article; zbMATH DE number 5670496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One upper bound on the \(D(2)\)-vertex-distinguishing chromatic numbers of graphs |
scientific article; zbMATH DE number 5670496 |
Statements
12 February 2010
0 references
graph
0 references
weighted local lemma
0 references
\(D(2)\)-vertex-distinguishing proper edge-coloring
0 references
\(D(2)\)-vertex-distinguishing proper edge-coloring chromatic number
0 references
0.9555562734603882
0 references
0.9198414087295532
0 references
0.8980267643928528
0 references
0.8580913543701172
0 references
0.8254002928733826
0 references
