Strong edge-coloring of graphs with maximum degree 4 using 22 colors (Q2433734)
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: Strong edge-coloring of graphs with maximum degree 4 using 22 colors |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong edge-coloring of graphs with maximum degree 4 using 22 colors |
scientific article |
Statements
Strong edge-coloring of graphs with maximum degree 4 using 22 colors (English)
0 references
30 October 2006
0 references
Erdős and Nesetril conjectured that every graph of even maximal degree \(\Delta\) can be strongly edge-colored by \(\frac54\Delta^2\) colors and if \(\Delta\) is odd by \(\frac14(5\Delta^2-2\Delta+1)\) colors. In this note the author gives a constructive contribution to the special case \(\Delta=4\).
0 references
edge-coloring
0 references
strong edge-coloring
0 references
0.9088448882102966
0 references
0.9045489430427552
0 references
0.9037656188011168
0 references
0.8724537491798401
0 references
0.8661997318267822
0 references
