@article{977c3bff0f5347ccaeca4a056cd0e2d1,
title = "Strong chromatic index of subcubic planar multigraphs",
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{\'a}rf{\'a}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.",
author = "Kostochka, {A. V.} and X. Li and W. Ruksasakchai and M. Santana and T. Wang and G. Yu",
note = "Funding Information: The authors thank the referees for their comments and careful reading of this paper. First author{\textquoteright}s research is supported in part by NSF grant DMS-1266016 and by grants 12-01-00631 and 12-01-00448 of the Russian Foundation for Basic Research . Second author{\textquoteright}s research is supported in part by the Natural Science Foundation of China ( 11171129 ) and by Doctoral Fund of Ministry of Education of China ( 20130144110001 ). Third author{\textquoteright}s research is supported in part by Development and Promotion of Science and Technology Talents Project (DPST) . Fourth author{\textquoteright}s research is supported in part by the NSF grants DMS-1266016 “AGEP-GRS” and DMS 08-38434 “EMSW21 - MCTP: Research Experience for Graduate Students.” Fifth author{\textquoteright}s research is supported by the National Natural Science Foundation of China ( 11101125 ) and partially supported by the Fundamental Research Funds for Universities in Henan . The author would like to thank Prof. Kostochka for his hospitality. Sixth author{\textquoteright}s research is supported in part by NSA grant H98230-12-1-0226 . Publisher Copyright: {\textcopyright} 2015 Elsevier Ltd.",
year = "2016",
month = jan,
day = "1",
doi = "10.1016/j.ejc.2015.07.002",
language = "English (US)",
volume = "51",
pages = "380--397",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",
}