Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6424083 | European Journal of Combinatorics | 2016 | 18 Pages |
Abstract
The strong chromatic index of a multigraph is the minimum k such that the edge set can be k-colored requiring that each color class induces a matching. We verify a conjecture of Faudree, Gyárfás, Schelp and Tuza, showing that every planar multigraph with maximum degree at most 3 has strong chromatic index at most 9, which is sharp.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
A.V. Kostochka, X. Li, W. Ruksasakchai, M. Santana, T. Wang, G. Yu,