Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:scholarworks.wm.edu:aspubs-1847

Strong chromatic index of subcubic planar multigraphs

Authors
Publication date
1 January 2016
Publisher
W&M ScholarWorks
Doi

    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

    Similar works

    Full text

    thumbnail-image

    College of William & Mary: W&M Publish

    redirect
    oaioai:scholarworks.wm.edu:aspubs...
    Last time updated on 30/10/2019

    This paper was published in College of William & Mary: W&M Publish.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.