Upper Bounds for the Strong Chromatic Index of Halin Graphs

Abstract The strong chromatic index of a graph G, denoted by χ′s(G), is the minimum number of vertex induced matchings needed to partition the edge set of G. Let T be a tree without vertices of degree 2 and have at least one vertex of degree greater than 2. We construct a Halin graph G by drawing T on the plane and then drawing a cycle C connecting all its leaves in such a way that C forms the boundary of the unbounded face. We call T the characteristic tree of G. Let G denote a Halin graph with maximum degree Δ and characteristic tree T. We prove that χ′s(G) ⩽ 2Δ + 1 when Δ ⩾ 4. In addition, we show that if Δ = 4 and G is not a wheel, then χ′s(G) ⩽ χ′s(T) + 2. A similar result for Δ = 3 was established by Lih and Liu [21].

[1]  William T. Trotter,et al.  Induced matchings in cubic graphs , 1993, J. Graph Theory.

[2]  Lars D@vling Andersen.  The strong chromatic index of a cubic graph is at most 10 , 1992, Discret. Math..

[3]  Paul Erdös,et al.  Problems and results in combinatorial analysis and graph theory , 1988, Discret. Math..

[4]  Michał Dębski,et al.  Strong chromatic index of graphs , 2015 .

[5]  Oleg V. Borodin,et al.  Precise Upper Bound for the Strong Edge Chromatic Number of Sparse Planar Graphs , 2013, Discuss. Math. Graph Theory.

[6]  Maksim Maydanskiy.  The incidence coloring conjecture for graphs of maximum degree 3 , 2005, Discret. Math..

[7]  Wensong Lin,et al.  The strong chromatic index of a class of graphs , 2008, Discret. Math..

[8]  Mohammad Mahdian.  On the computational complexity of strong edge coloring , 2002, Discret. Appl. Math..

[9]  Hervé Hocquard,et al.  On strong edge-colouring of subcubic graphs , 2013, Discret. Appl. Math..

[10]  Gexin Yu,et al.  Strong Chromatic Index of Graphs With Maximum Degree Four , 2018, Electron. J. Comb..

[11]  Wai Chee Shiu,et al.  The strong chromatic index of complete cubic Halin graphs , 2009, Appl. Math. Lett..

[12]  Bruce A. Reed,et al.  A Bound on the Strong Chromatic Index of a Graph, , 1997, J. Comb. Theory, Ser. B.

[13]  Mohammad R. Salavatipour.  A polynomial time algorithm for strong edge coloring of partial k-trees , 2004, Discret. Appl. Math..

[14]  Stephen G. Hartke,et al.  On the Strong Chromatic Index of Sparse Graphs , 2015, Electron. J. Comb..

[15]  Daniel W. Cranston.  Strong edge-coloring of graphs with maximum degree 4 using 22 colors , 2006, Discret. Math..

[16]  Mohammad Mahdian,et al.  The strong chromatic index of graphs , 2000 .

[17]  Leandro Montero,et al.  Further results on strong edge-colourings in outerplanar graphs , 2015, Australas. J Comb..

[18]  Moshe Lewenstein,et al.  New results on induced matchings , 2000, Discret. Appl. Math..

[19]  Hervé Hocquard,et al.  Strong edge-colouring of sparse planar graphs , 2014, Discret. Appl. Math..

[20]  Ko-Wei Lih,et al.  The strong chromatic index of Halin graphs , 2012, Discret. Math..

[21]  Ko-Wei Lih,et al.  On the strong chromatic index of cubic Halin graphs , 2012, Appl. Math. Lett..

[22]  Jessica Engel,et al.  Problem , 1902 .

[23]  André Raspaud,et al.  Strong chromatic index of planar graphs with large girth , 2013 .

[24]  Daphne Der-Fen Liu,et al.  Strong edge-coloring for cubic Halin graphs , 2012, Discret. Math..

[25]  Yuehua Bu,et al.  Strong edge-coloring of subcubic planar graphs , 2017, Discret. Math. Algorithms Appl..

[26]  Lianying Miao,et al.  Strong Edge-Coloring Of Planar Graphs , 2017, Discuss. Math. Graph Theory.

[27]  Gerard J. Chang,et al.  On the precise value of the strong chromatic index of a planar graph with a large girth , 2018, Discret. Appl. Math..

[28]  Angelika Steger,et al.  On induced matchings , 1993, Discret. Math..

[29]  P. C. B. Lam,et al.  On strong chromatic index of Halin graph , 2006 .

[30]  Henning Bruhn,et al.  A stronger bound for the strong chromatic index , 2015, Electron. Notes Discret. Math..