Loading...
Strong chromatic index of subcubic planar multigraphs
Kostochka, A. V. Santana, M. Li, X. Yu, G.
Kostochka, A. V.
Santana, M.
Li, X.
Yu, G.
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.
Description
Date
2016-01-01
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Download Dataset
Files
Loading...
strong_chromatic.pdf
Adobe PDF, 490.16 KB
Rights Holder
Usage License
Embargo
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
Advisor
Department
Mathematics
DOI
10.1016/j.ejc.2015.07.002