Abstract
An edge-coloring of a graph G is injective if for any two distinct edges \(e_1\) and \(e_2\), the colors of \(e_1\) and \(e_2\) are distinct if they are at distance 2 in G or in a common triangle. The injective chromatic index of G, \(\chi ^\prime _{inj}(G)\), is the minimum number of colors needed for an injective edge-coloring of G. In this note, we show that every \(K_4\)-minor free graph G with maximum degree \(\Delta (G)\ge 3\) satisfies \(\chi ^\prime _{inj}(G)\le 2\Delta (G)+1\).
Similar content being viewed by others
References
Bondy, J. A., Murty, U. S. R.: Graph Theory, Springer (2008)
Bradshaw, P., Clow, A., Xu, J.: Injective edge coloring of degenerate graphs and the oriented chromatic number, arXiv:2308.15654v1
Bu, Y., Qi, C.: Injective edge coloring of sparse graphs. Discret. Math. Algorithm. Appl. 10, 1850022 (2018)
Bu, Y., Wang, P., Zhu, H., Zhu, J.: injective chromatic index of sparse graphs. Discret. Appl. Math. 345, 9–16 (2024)
Cardoso, D., Cerdeira, J., Cruz, J., Dominic, C.: Injective edge coloring of graphs. Filomat 19, 6411–6423 (2019)
Dirac, G.: A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc. 27, 85–92 (1952)
Erdős, P., Rubin, A., Taylor, H.: Choosability graphs. Proc. West Coast Conf. Comb. Gr. Theory Comput. Congr. Numer. XXVI, 125–157 (1979)
Ferdjallah, B., Kerdjoudj, S., Raspaud, A.: Injective edge-coloring of subcubic graphs. Discrete Math. Algorithm. Appl. 14, 2250040 (2022)
Kostochka, A., Raspaud, A., Xu, J.: Injective edge-coloring of graphs with given maximum degree. Eur. J. Combin. 96, 103355 (2021)
Lu, J., Liu, H., Hu, X.: Injective edge coloring for graphs with small edge weight. Gr. Combin. 38, 160 (2022)
Lv, J.-B., Li, J., Zhou, N.: List injective edge-coloring of subcubic graphs. Discret. Appl. Math. 302, 163–170 (2021)
Miao, Z., Song, Y., Yu, G.: Note on injective edge-coloring of graphs. Discret. Appl. Math. 310, 65–74 (2022)
Yang, W., Wu, B.: Injective edge-coloring of graphs with small weight. Gr. Combin. 38, 178 (2022)
Vizing, V.: Coloring the vertices of a graph with prescribed colours (in Russian). Metody Diskret. Analiz. 29, 3–10 (1976)
Zhu, J., Bu, Y., Zhu, H.: Injective edge coloring of sparse graphs with maximum degree 5. J. Comb. Optim. 45, 46 (2023)
Zhu, J.: Injective edge coloring of graphs with maximum degree \(5\). Discret. Appl. Math. 334, 119–126 (2023)
Acknowledgements
We thank referees for his/her careful reading of the paper and many constructive suggestions that improve the presentation of the paper greatly. This research was partially supported by the Key Laboratory of Mathematical Model and Application (Guangxi Normal University), Education Department of Guangxi Zhuang Autonomous Region.
Funding
Research of Jian-Bo Lv was supported by the Science and technology project of Guangxi (Guike AD21220114); NSFC (12301436). Research of Jianxi Li was supported by NSFC (12171089); NSF of Fujian (2021J02048).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Confict of Interest
The authors declare that they have no known competing financial interests or personal relationship that could have appeared to influence the work reported in this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
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
Lv, JB., Fu, J. & Li, J. Injective Chromatic Index of \(K_4\)-Minor Free Graphs. Graphs and Combinatorics 40, 77 (2024). https://doi.org/10.1007/s00373-024-02807-3
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-024-02807-3