{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:54:56Z","timestamp":1781463296022,"version":"3.54.1"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100006683","name":"Xi'an Jiaotong-Liverpool University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006683","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.04.033","type":"journal-article","created":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T13:45:58Z","timestamp":1778161558000},"page":"68-82","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Packing edge-colorings of subcubic outerplanar graphs"],"prefix":"10.1016","volume":"391","author":[{"given":"Sijin","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yifan","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8995-959X","authenticated-orcid":false,"given":"Xujun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.04.033_b1","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":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.033_b2","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1002\/jgt.22802","article-title":"Strong edge colorings of graphs and the covers of Kneser graphs","volume":"100","author":"B.\u00a0Lu\u017ear","year":"2022","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.04.033_b3","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1016\/j.disc.2017.09.014","article-title":"Packing chromatic number of cubic graphs","volume":"341","author":"Balogh","year":"2018","journal-title":"Discrete Math."},{"issue":"5","key":"10.1016\/j.dam.2026.04.033_b4","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1007\/s00010-020-00721-6","article-title":"Packing colorings of subcubic outerplanar graphs","volume":"94","author":"Bre\u0161ar","year":"2020","journal-title":"Aequationes Math."},{"key":"10.1016\/j.dam.2026.04.033_b5","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1016\/j.disc.2016.09.030","article-title":"Packing chromatic number under local changes in a graph","volume":"340","author":"Bre\u0161ar","year":"2017","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/j.dam.2026.04.033_b6","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.disc.2018.10.019","article-title":"Strong edge-coloring for planar graphs with large girth","volume":"342","author":"Chen","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.033_b7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.ejc.2017.06.001","article-title":"Strong edge-coloring of sparse graphs with large maximum degree","volume":"67","author":"Choi","year":"2016","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2026.04.033_b8","series-title":"Irregularities of Partitions","first-page":"162","author":"Erd\u0151s","year":"1989"},{"key":"10.1016\/j.dam.2026.04.033_b9","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1016\/j.ejc.2008.09.014","article-title":"The packing chromatic number of infinite product graphs","volume":"30","author":"Fiala","year":"2009","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2026.04.033_b10","first-page":"141","article-title":"Strong edge-colorings of graphs and applications to multi-k-gons","volume":"16A","author":"Fouquet","year":"1983","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2026.04.033_b11","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1137\/S0895480104445757","article-title":"The strong chromatic index of random graphs","volume":"19","author":"Frieze","year":"2005","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2026.04.033_b12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.dam.2018.07.034","article-title":"On packing chromatic number of subcubic outerplanar graphs","volume":"255","author":"Gastineau","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.04.033_b13","doi-asserted-by":"crossref","first-page":"2461","DOI":"10.1016\/j.disc.2016.04.017","article-title":"S-packing colorings of cubic graphs","volume":"339","author":"Gastineau","year":"2016","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.033_b14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.dam.2018.12.035","article-title":"On S-packing edge-colorings of cubic graphs","volume":"259","author":"Gastineau","year":"2019","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.dam.2026.04.033_b15","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1002\/jgt.22848","article-title":"Between proper and strong edge-colorings of subcubic graphs","volume":"101","author":"Hocquard","year":"2022","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.04.033_b16","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1016\/j.ipl.2013.07.026","article-title":"Strong edge-colouring and induced matchings","volume":"113","author":"Hocquard","year":"2013","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/j.dam.2026.04.033_b17","doi-asserted-by":"crossref","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":"10.1016\/j.dam.2026.04.033_b18","doi-asserted-by":"crossref","DOI":"10.19086\/aic.2022.7","article-title":"An improved procedure for colouring graphs of bounded local density","author":"Hurley","year":"2022","journal-title":"Advances in Combinatorics"},{"key":"10.1016\/j.dam.2026.04.033_b19","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/j.ejc.2015.07.002","article-title":"Strong chromatic index of subcubic planar multigraphs","volume":"51","author":"Kostochka","year":"2016","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2026.04.033_b20","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.dam.2021.05.031","article-title":"Packing (1, 1, 2, 4)-coloring of subcubic outerplanar graphs","volume":"302","author":"Kostochka","year":"2021","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.dam.2026.04.033_b21","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1002\/jgt.23004","article-title":"Every subcubic multigraph is (1,27)-packing edge-colorable","volume":"104","author":"Liu","year":"2023","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.04.033_b22","unstructured":"X. Liu, G. Yu, On the (12,24)-packing edge-coloring of subcubic graphs, arXiv:2402.18353."},{"key":"10.1016\/j.dam.2026.04.033_b23","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1006\/jctb.1997.1724","article-title":"A bound on the strong chromatic index of a graph","volume":"69","author":"Molloy","year":"1997","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"10.1016\/j.dam.2026.04.033_b24","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/jgt.3190170204","article-title":"Induced matchings in cubic graphs","volume":"17","author":"P.\u00a0Hor\u00e1k","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.04.033_b25","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"Vizing","year":"1964","journal-title":"Metod. Disk. Anal."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002568?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002568?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:06:56Z","timestamp":1781460416000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26002568"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":25,"alternative-id":["S0166218X26002568"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.033","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Packing edge-colorings of subcubic outerplanar graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.033","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}