Strong chromatic index of subcubic planar multigraphs

A. V. Kostochka, X. Li, W. Ruksasakchai, M. Santana, T. Wang, G. Yu

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)380-397
Number of pages18
JournalEuropean Journal of Combinatorics
StatePublished - Jan 1 2016

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Strong chromatic index of subcubic planar multigraphs'. Together they form a unique fingerprint.

Cite this