An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph (Q1036905): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10255-007-7020-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2025895663 / rank | |||
Normal rank | |||
Revision as of 20:53, 19 March 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
