Elsevier

European Journal of Combinatorics

Volume 51, January 2016, Pages 380-397
European Journal of Combinatorics

Strong chromatic index of subcubic planar multigraphs

Dedicated to the memory of Ralph J. Faudree
https://doi.org/10.1016/j.ejc.2015.07.002Get rights and content
Under an Elsevier user license
open archive

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.

Cited by (0)

1

This research was done while the author was visiting the University of Illinois at Urbana-Champaign.