An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph (Q1036905): Difference between revisions
From MaRDI portal
Latest revision as of 03:48, 2 July 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