{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T05:07:06Z","timestamp":1764133626173,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T00:00:00Z","timestamp":1685923200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["11901434","5RL159"],"award-info":[{"award-number":["11901434","5RL159"]}]},{"name":"Talent Fund Project of Tianjin Normal University, China","award":["11901434","5RL159"],"award-info":[{"award-number":["11901434","5RL159"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>A strong edge coloring of a graph G is a proper coloring of edges in G such that any two edges of distance at most 2 are colored with distinct colors. The strong chromatic index \u03c7s\u2032(G) is the smallest integer l such that G admits a strong edge coloring using l colors. A K4(t)-minor free graph is a graph that does not contain K4(t) as a contraction subgraph, where K4(t) is obtained from a K4 by subdividing edges exactly t\u22124 times. The paper shows that every K4(t)-minor free graph with maximum degree \u0394(G) has \u03c7s\u2032(G)\u2264(t\u22121)\u0394(G) for t\u2208{5,6,7} which generalizes some known results on K4-minor free graphs by Batenburg, Joannis de Verclos, Kang, Pirot in 2022 and Wang, Wang, and Wang in 2018. These upper bounds are sharp.<\/jats:p>","DOI":"10.3390\/axioms12060556","type":"journal-article","created":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T04:01:47Z","timestamp":1685937707000},"page":"556","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Strong Edge Coloring of K4(t)-Minor Free Graphs"],"prefix":"10.3390","volume":"12","author":[{"given":"Huixin","family":"Yin","sequence":"first","affiliation":[{"name":"College of Mathematical Science, Tianjin Normal University, Tianjin 300387, China"}]},{"given":"Miaomiao","family":"Han","sequence":"additional","affiliation":[{"name":"College of Mathematical Science, Tianjin Normal University, Tianjin 300387, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9735-7214","authenticated-orcid":false,"given":"Murong","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Scranton, Scranton, PA 18510, USA"}]}],"member":"1968","published-online":{"date-parts":[[2023,6,5]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0012-365X(88)90196-3","article-title":"Problems and results in combinatorial analysis and graph theory","volume":"72","year":"1988","journal-title":"Discret. Math."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0012-365X(92)90678-9","article-title":"The strong chromatic index of a cubic graph is at most 10","volume":"108","author":"Andersen","year":"1992","journal-title":"Discret. Math."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2772","DOI":"10.1016\/j.disc.2006.03.053","article-title":"Strong edge-colouring of graphs with maximum degree 4 using 22 colors","volume":"306","author":"Cranston","year":"2006","journal-title":"Discret. Math."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"#3.31","DOI":"10.37236\/7016","article-title":"Strong chromatic index of graphs with maximum degree four","volume":"25","author":"Huang","year":"2018","journal-title":"Electron. J. Combin."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<357::AID-RSA9>3.0.CO;2-Y","article-title":"The strong chromatic index of C4-free graphs","volume":"17","author":"Mahdian","year":"2000","journal-title":"Random Struct. Algorithms"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Hurley, E., Joannis de Verclos, R., and Kang, R.J. (2022). An improved procedure for colouring graphs of bounded local density. Adv. Comb., 7\u201333.","DOI":"10.19086\/aic.2022.7"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.disc.2014.04.016","article-title":"Strong chromatic index of k-degenerate graphs","volume":"330","author":"Wang","year":"2014","journal-title":"Discret. Math."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.ejc.2017.06.001","article-title":"Strong edge-colorings of sparse graphs with large maximum degree","volume":"67","author":"Choi","year":"2018","journal-title":"Eur. J. Comb."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.dam.2023.03.028","article-title":"Strong edge-coloring of 2-degenerate graphs","volume":"336","author":"Yu","year":"2023","journal-title":"Discret. Appl. Math."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1002\/jgt.21839","article-title":"Strong chromatic index of chordless graphs","volume":"80","author":"Basavaraju","year":"2015","journal-title":"J. Graph Theory"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Wang, Y., Song, N., Wang, J., and Wang, W. (2022). The strong chromatic index of 1-planar graphs. arXiv.","DOI":"10.3390\/sym14061177"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Cranston, D.W. (2022). Coloring, List Coloring, and Painting Squares of Graphs (and other related problems). arXiv.","DOI":"10.37236\/10898"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.dam.2020.03.024","article-title":"Strong chromatic index of K1,t-free graphs","volume":"284","author":"Szaniawski","year":"2020","journal-title":"Discret. Appl. Math."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2467","DOI":"10.1016\/j.dam.2013.05.021","article-title":"On strong-edge colouring of subcubic graphs","volume":"161","author":"Hocquard","year":"2013","journal-title":"Discret. Appl. Math."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Wang, Y., Wang, Y., Wang, W., and Cui, S. (2022). Strong chromatic index of outerplanar graphs. Axioms, 11.","DOI":"10.3390\/axioms11040168"},{"key":"ref_16","first-page":"205","article-title":"The strong chromatic index of graphs","volume":"29","author":"Faudree","year":"1990","journal-title":"Ars Comb."},{"key":"ref_17","first-page":"133","article-title":"\u00dcber eine Klassifikation der Streckenkomplexe. Vierteljschr. Naturforsch","volume":"88","author":"Hadwiger","year":"1943","journal-title":"Ges. Z\u00fcr."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/BF01594196","article-title":"\u00dcber eine Eigenschaft der ebenen Komplexe","volume":"114","author":"Wagner","year":"1937","journal-title":"Math. Ann."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01202354","article-title":"Hadwiger\u2019s conjecture for K6-free graphs","volume":"13","author":"Robertson","year":"1993","journal-title":"Combinatorica"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1002\/jgt.22203","article-title":"On triangles in Kr-minor free graphs","volume":"88","author":"Albar","year":"2018","journal-title":"J. Graph Theory"},{"key":"ref_21","unstructured":"Delcourt, M., and Postle, L. (2021). Reducing linear Hadwiger\u2019s conjecture to coloring small graphs. arXiv."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1002\/jgt.22788","article-title":"Strong chromatic index and hadwiger number","volume":"100","author":"Batenburg","year":"2022","journal-title":"J. Graph Theory"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.ipl.2017.09.007","article-title":"Strong chromatic index of K4-minor free graphs","volume":"129","author":"Wang","year":"2018","journal-title":"Inform. Process. Lett."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"125206","DOI":"10.1016\/j.amc.2020.125206","article-title":"Decomposition and r-hued coloring of K4(7)-minor free graphs","volume":"38","author":"Chen","year":"2020","journal-title":"Appl. Math. Comput."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/6\/556\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:48:24Z","timestamp":1760125704000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/6\/556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,5]]},"references-count":24,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2023,6]]}},"alternative-id":["axioms12060556"],"URL":"https:\/\/doi.org\/10.3390\/axioms12060556","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2023,6,5]]}}}