IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v325y2018icp246-251.html
   My bibliography  Save this article

Odd graph and its applications to the strong edge coloring

Author

Listed:
  • Wang, Tao
  • Zhao, Xiaodan

Abstract

A strong edge coloring of a graph is a proper edge coloring in which every color class is an induced matching. The strong chromatic index χs′(G) of a graph G is the minimum number of colors in a strong edge coloring of G. Let Δ ≥ 4 be an integer. In this note, we study the odd graphs and show the existence of some special walks. By using these results and Chang’s et al. (2014) ideas, we show that every planar graph with maximum degree at most Δ and girth at least 10Δ−4 has a strong edge coloring with 2Δ−1 colors. In addition, we prove that if G is a graph with girth at least 2Δ−1 and mad(G)<2+13Δ−2, where Δ is the maximum degree and Δ ≥ 4, then χs′(G)≤2Δ−1; if G is a subcubic graph with girth at least 8 and mad(G)<2+223, then χs′(G)≤5.

Suggested Citation

  • Wang, Tao & Zhao, Xiaodan, 2018. "Odd graph and its applications to the strong edge coloring," Applied Mathematics and Computation, Elsevier, vol. 325(C), pages 246-251.
    • Handle: RePEc:eee:apmaco:v:325:y:2018:i:c:p:246-251
    DOI: 10.1016/j.amc.2017.11.057
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317308469
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.11.057?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:325:y:2018:i:c:p:246-251. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.