An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph (Q741759)
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 improved upper bound on the adjacent vertex distinguishing chromatic index of a graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph |
scientific article |
Statements
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph (English)
0 references
12 September 2014
0 references
adjacent vertex distinguishing coloring
0 references
maximum degree
0 references
edge-partition
0 references
0 references
0 references
0 references
0.9311933517456056
0 references
0.9172265529632568
0 references
0.9118431806564332
0 references
0.9041421413421632
0 references
0.900806486606598
0 references
