Strong edge-coloring of graphs with maximum degree 4 using 22 colors (Q2433734): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56390640 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086384546 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0601623 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The strong chromatic index of a cubic graph is at most 10 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5752590 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3201075 / rank | |||
Normal rank | |||
Revision as of 21:26, 24 June 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
