An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph (Q741759)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
