Strong edge-coloring of graphs with maximum degree 4 using 22 colors (Q2433734): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56390640, #quickstatements; #temporary_batch_1707161894653 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:09, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
