An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph (Q1036905)
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 upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph |
scientific article; zbMATH DE number 5632899
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph |
scientific article; zbMATH DE number 5632899 |
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
