Document Type
Article
Department/Program
Mathematics
Journal Title
European Journal of Combinatorics
Pub Date
2016
Volume
51
First Page
380
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, Gyarfas, Schelp and Tuza, showing that every planar multigraph with maximum degree at most 3 has strong chromatic index at most 9, which is sharp. (C) 2015 Elsevier Ltd. All rights reserved.
Recommended Citation
Kostochka, A. V.; Santana, M.; Li, X.; and Yu, G., Strong chromatic index of subcubic planar multigraphs (2016). European Journal of Combinatorics, 51, 380-397.
10.1016/j.ejc.2015.07.002
DOI
10.1016/j.ejc.2015.07.002
COinS
