{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:28Z","timestamp":1753893868036,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The strong chromatic index of a graph $G$, denoted $\\chi'_s(G)$, is the least number of colors needed to edge-color $G$ so that edges at distance at most two receive distinct colors. The strong list chromatic index, denoted $\\chi'_{s,\\ell}(G)$, is the least integer $k$ such that if arbitrary lists of size $k$ are assigned to each edge then $G$ can be edge-colored from those lists where edges at distance at most two receive distinct colors.We use the discharging method, the Combinatorial Nullstellensatz, and computation to show that if $G$ is a subcubic planar graph with ${\\rm girth}(G) \\geq 41$ then $\\chi'_{s,\\ell}(G) \\leq 5$, answering a question of Borodin and Ivanova [Precise upper bound for the strong edge chromatic number of sparse planar graphs, Discuss. Math. Graph Theory, 33(4), (2014) 759--770]. We further show that if $G$ is a subcubic planar graph and ${\\rm girth}(G) \\geq 30$, then $\\chi_s'(G) \\leq 5$, improving a bound from the same paper.Finally, if $G$ is a planar graph with maximum degree at most four and ${\\rm girth}(G) \\geq 28$, then $\\chi'_s(G)N \\leq 7$, improving a more general bound of Wang and Zhao from [Odd graphs and its applications to the strong edge coloring, Applied Mathematics and Computation, 325 (2018), 246-251] in this case.<\/jats:p>","DOI":"10.37236\/5390","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:17:10Z","timestamp":1578669430000},"source":"Crossref","is-referenced-by-count":2,"title":["On the Strong Chromatic Index of Sparse Graphs"],"prefix":"10.37236","volume":"25","author":[{"given":"Philip","family":"DeOrsey","sequence":"first","affiliation":[]},{"given":"Michael","family":"Ferrara","sequence":"additional","affiliation":[]},{"given":"Nathan","family":"Graber","sequence":"additional","affiliation":[]},{"given":"Stephen G.","family":"Hartke","sequence":"additional","affiliation":[]},{"given":"Luke L.","family":"Nelsen","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Sullivan","sequence":"additional","affiliation":[]},{"given":"Sogol","family":"Jahanbekam","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Lidick\u00fd","sequence":"additional","affiliation":[]},{"given":"Derrick","family":"Stolee","sequence":"additional","affiliation":[]},{"given":"Jennifer","family":"White","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2018,7,27]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i3p18\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i3p18\/html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i3p18\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:30:26Z","timestamp":1579235426000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i3p18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,27]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2018,7,12]]}},"URL":"https:\/\/doi.org\/10.37236\/5390","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,7,27]]},"article-number":"P3.18"}}