IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v33y2017i2d10.1007_s10878-015-9983-6.html
   My bibliography  Save this article

On (s, t)-relaxed strong edge-coloring of graphs

Author

Listed:
  • Dan He

    (Southeast University)

  • Wensong Lin

    (Southeast University)

Abstract

In this paper, we introduce a new relaxation of strong edge-coloring. Let G be a graph. For two nonnegative integers s and t, an (s, t)-relaxed strong k-edge-coloring is an assignment of k colors to the edges of G, such that for any edge e, there are at most s edges adjacent to e and t edges which are distance two apart from e assigned the same color as e. The (s, t)-relaxed strong chromatic index, denoted by $${\chi '}_{(s,t)}(G)$$ χ ′ ( s , t ) ( G ) , is the minimum number k of an (s, t)-relaxed strong k-edge-coloring admitted by G. This paper studies the (s, t)-relaxed strong edge-coloring of graphs, especially trees. For a tree T, the tight upper bounds for $${\chi '}_{(s,0)}(T)$$ χ ′ ( s , 0 ) ( T ) and $${\chi '}_{(0,t)}(T)$$ χ ′ ( 0 , t ) ( T ) are given. And the (1, 1)-relaxed strong chromatic index of an infinite regular tree is determined. Further results on $${\chi '}_{(1,0)}(T)$$ χ ′ ( 1 , 0 ) ( T ) are also presented.

Suggested Citation

  • Dan He & Wensong Lin, 2017. "On (s, t)-relaxed strong edge-coloring of graphs," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 609-625, February.
    • Handle: RePEc:spr:jcomop:v:33:y:2017:i:2:d:10.1007_s10878-015-9983-6
    DOI: 10.1007/s10878-015-9983-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9983-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-015-9983-6?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:spr:jcomop:v:33:y:2017:i:2:d:10.1007_s10878-015-9983-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.