15.05.2020 | Ausgabe 1/2020
The strong chromatic index of graphs with edge weight eight
- Zeitschrift:
- Journal of Combinatorial Optimization > Ausgabe 1/2020
Wichtige Hinweise
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Abstract
The edge weight of a graph G is defined to be \(\max \{d_G(u) + d_G(v): uv \in E(G)\}\). The strong chromatic index of a graph is the minimum value of k such that the edge set of G can be partitioned into k induced matchings. In this article, we prove that the strong chromatic index of a graph with edge weight eight is at most 21.
