Precise upper bound for the strong edge chromatic number of sparse planar graphs (Q5495056)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6323194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Precise upper bound for the strong edge chromatic number of sparse planar graphs |
scientific article; zbMATH DE number 6323194 |
Statements
Precise upper bound for the strong edge chromatic number of sparse planar graphs (English)
0 references
30 July 2014
0 references
planar graph
0 references
edge coloring
0 references
2-distance coloring
0 references
strong edge coloring
0 references
0.9392444
0 references
0.91579664
0 references
0.9134935
0 references
0.9118501
0 references
0 references
0 references
0 references
0.90711653
0 references
0.9060842
0 references
0 references
