Strong chromatic index of planar graphs with large girth
Journal
Discussiones Mathematicae - Graph Theory
Journal Volume
34
Journal Issue
4
Pages
723-733
Date Issued
2014
Author(s)
Abstract
Let 4 be an integer. In this note, we prove that every planar graph with maximum degree and girth at least 10 + 46 is strong (2 -1)-edgecolorable, that is best possible (in terms of number of colors) as soon as G contains two adjacent vertices of degree . This improves [6] when 6.
Type
journal article