An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph (Q1036905): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:50, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph |
scientific article |
Statements
An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph (English)
0 references
13 November 2009
0 references
adjacent strong edge coloring
0 references
adjacent vertex distinguishing acyclic edge coloring
0 references
adjacent vertex distinguishing acyclic edge chromatic number
0 references
the Lovász local lemma
0 references
