Abstract
Let G be a graph and k a positive integer. A strong k-edge-coloring of G is a mapping \(\phi : E(G)\rightarrow \{1,2,\dots ,k\}\) such that for any two edges e and \(e'\) that are either adjacent to each other or adjacent to a common edge, \(\phi (e)\ne \phi (e')\). The strong chromatic index of G, denoted as \(\chi '_{s}(G)\), is the minimum integer k such that G has a strong k-edge-coloring. Lv, Li and Zhang [Graphs and Combinatorics 38 (3) (2022) 63] proved that if G is a claw-free subcubic graph other than the triangular prism then \(\chi _s'(G)\le 8\). In addition, they asked if the upper bound 8 can be improved to 7. In this paper, we answer this question in the affirmative. Our proof implies a polynomial-time algorithm for finding strong 7-edge-colorings of such graphs. We also construct infinitely many claw-free subcubic graphs with their strong chromatic indices attaining the bound 7.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data Availability Statement
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
Code Availability
Not applicable.
References
Andersen, L.D.: The strong chromatic index of a cubic graph is at most 10. Discret. Math. 108, 231–252 (1992)
Bensmail, J., Bonamy, M., Hocquard, H.: Strong edge coloring sparse graphs. Electron. Notes Discret. Math. 49, 773–778 (2015)
Bonamy, M., Perrett, T., Postle, L.: Colouring graphs with sparse neighbourhoods: bounds and applications. J. Comb. Theory Ser. B 155, 278–317 (2022)
Bruhn, H., Joos, F.: A stronger bound for the strong chromatic index. Electron. Notes Discret. Math. 49, 277–284 (2015)
Cranston, D.W.: Strong edge-coloring of graphs with maximum degree 4 using 22 colors. Discret. Math. 306(21), 2772–2778 (2006)
Dębski, M., Junosza-Szaniawski, K., Śleszyńska-Nowak, M.: Strong chromatic index of \(K_{1, t}\)-free graphs. Discret Appl. Math. 284, 53–60 (2020)
Erdős, P.: Problems and results in combinatorial analysis and graph theory. Discret. Math. 72, 81–92 (1988)
Erdős, P., Nešetřil, J.: Problems. In: Halász, G., Sós, V.T. (eds.) Irregularities of Partitions, pp. 162–163. Springer, Berlin (1989)
The strong chromatic index of graphs: Faudree, R.J., Schelp, R.H., Gyárfás, A., Tuza, Zs. Ars Comb. 29B, 205–211 (1990)
Fouquet, J.L., Jolivet, J.L.: Strong edge-colorings of graphs and applications to multi-\(k\)-gons. Ars Comb. 16A, 141–150 (1983)
Hall, P.: On representatives of subsets. J. Lond. Math. Soc. 10, 26–30 (1935)
Horák, P.: The strong chromatic index of graphs with maximum degree four. Contemp. Methods Graph Theory 399, 403 (1990)
Horák, P., Qing, H., Trotter, W.T.: Induced matchings in cubic graphs. J. Graph Theory 17(2), 151–160 (1993)
Huang, M., Santana, M., Yu, G.: Strong chromatic index of graphs with maximum degree four. Electron. J. Comb. 25(3), #P3.31 (2018)
Hurley, E., de Joannis de Verclos, R., Kang, R.J.: An improved procedure for colouring graphs of bounded local density. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 135–148 (2021). https://arxiv.org/abs/2007.07874
Kostochka, A.V., Li, X., Ruksasakchai, W., Santana, M., Wang, T., Yu, G.: Strong chromatic index of subcubic planar multigraphs. Eur. J. Comb. 51, 380–397 (2016)
Lv, J.-B., Li, X., Yu, G.: On strong edge-coloring of graphs with maximum degree 4. Discret. Appl. Math. 235, 142–153 (2018)
Lv, J.-B., Li, J., Zhang, X.: On strong edge-coloring of claw-free subcubic graphs. Graphs Comb. 38(3), 63 (2022)
Molloy, M., Reed, B.: A bound on the strong chromatic index of a graph. J. Comb. Theory Ser. B 69(2), 103–109 (1997)
Nandagopal, T., Kim, T., Gao, X., Bharghavan, V.: Achieving MAC layer fairness in wireless packet networks. In: Proceedings of the 6th annual international conference on Mobile computing and networking, pp. 87–98 (2000)
Ramanathan, S.: A unified framework and algorithm for (T/F/C) DMA channel assignment in wireless networks. Proc. INFOCOM’97 IEEE 2, 900–907 (1997)
Wang, Y., Shiu, W.C., Wang, W., Chen, M.: Planar graphs with maximum degree 4 are strongly 19-edge-colorable. Discret. Math. 341(6), 1629–1635 (2018)
Wu, J., Lin, W.: The strong chromatic index of a class of graphs. Discret. Math. 308, 6254–6261 (2008)
Zang, C.: The strong chromatic index of graphs with maximum degree \(\Delta \). preprint (2015). arXiv:1510.00785 [math.CO]
Acknowledgements
We are very grateful to the reviewers for carefully reading this paper and putting forward many detailed and valuable suggestions to improve the paper.
Funding
This work was supported by NSFC under grant 11771080.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
No conflicts.
Ethical Approval
Not applicable.
Consent to Participate
All authors consent to participate.
Consent for Publication
All participants consent for publication.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supported by NSFC 11771080.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Lin, Y., Lin, W. The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs. Graphs and Combinatorics 39, 58 (2023). https://doi.org/10.1007/s00373-023-02655-7
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-023-02655-7