Upper bound on 2-strong edge chromatic numbers of graphs (Q2923823)
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: Upper bound on 2-strong edge chromatic numbers of graphs |
scientific article; zbMATH DE number 6364364
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bound on 2-strong edge chromatic numbers of graphs |
scientific article; zbMATH DE number 6364364 |
Statements
3 November 2014
0 references
2-strong edge coloring
0 references
2-strong edge chromatic number
0 references
general local lemma
0 references
Upper bound on 2-strong edge chromatic numbers of graphs (English)
0 references
