{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T11:08:42Z","timestamp":1776078522871,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.dam.2026.02.040","type":"journal-article","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T08:39:09Z","timestamp":1773650349000},"page":"345-364","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Planar graphs with Ore-degree at most seven is strongly 13-edge-colorable"],"prefix":"10.1016","volume":"386","author":[{"given":"Seth","family":"Nelson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5898-7344","authenticated-orcid":false,"given":"Gexin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.02.040_b1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1017\/S0963548398003411","article-title":"Combinatorial nullstellensatz","volume":"8","author":"Alon","year":"1999","journal-title":"Combin. Probab. Comput."},{"issue":"1\u20133","key":"10.1016\/j.dam.2026.02.040_b2","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."},{"issue":"5","key":"10.1016\/j.dam.2026.02.040_b3","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1016\/j.disc.2018.10.034","article-title":"List strong edge coloring of planar graphs with maximum degree 4","volume":"342","author":"Chen","year":"2019","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.dam.2026.02.040_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2019.111779","article-title":"The strong edge-coloring for graphs with small edge weight","volume":"343","author":"Chen","year":"2020","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.02.040_b5","first-page":"7","article-title":"Irregularities of partitions","volume":"vol. 8","author":"Erd\u0151s","year":"1989"},{"key":"10.1016\/j.dam.2026.02.040_b6","series-title":"Twelfth British Combinatorial Conference (Norwich, 1989)","first-page":"205","article-title":"The strong chromatic index of graphs","volume":"Vol. 29","author":"Faudree","year":"1990"},{"key":"10.1016\/j.dam.2026.02.040_b7","first-page":"141","article-title":"Strong edge-colorings of graphs and applications to multi-k-gons","volume":"16","author":"Fouquet","year":"1983","journal-title":"Ars Combin."},{"issue":"3","key":"10.1016\/j.dam.2026.02.040_b8","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1145\/1504347.1504377","article-title":"SINGULAR: a computer algebra system for polynomial computations","volume":"42","author":"Greuel","year":"2008","journal-title":"ACM Commun. Comput. Algebra"},{"issue":"1","key":"10.1016\/j.dam.2026.02.040_b9","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","article-title":"On representatives of subsets","volume":"10","author":"Hall","year":"1935","journal-title":"J. Lond. Math. Soc."},{"issue":"2","key":"10.1016\/j.dam.2026.02.040_b10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/jgt.3190170204","article-title":"Induced matchings in cubic graphs","volume":"17","author":"Hor\u00e1k","year":"1993","journal-title":"J. Graph Theory"},{"issue":"6","key":"10.1016\/j.dam.2026.02.040_b11","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/s00373-023-02714-z","article-title":"Strong list-chromatic index of planar graphs with ore- degree at most seven","volume":"39","author":"Huang","year":"2023","journal-title":"Graphs Combin."},{"issue":"3","key":"10.1016\/j.dam.2026.02.040_b12","doi-asserted-by":"crossref","first-page":"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."},{"issue":"7","key":"10.1016\/j.dam.2026.02.040_b13","first-page":"33","article-title":"An improved procedure for colouring graphs of bounded local density","author":"Hurley","year":"2022","journal-title":"Adv. Comb."},{"key":"10.1016\/j.dam.2026.02.040_b14","first-page":"373","article-title":"The strong chromatic index of graphs with restricted ore-degrees","volume":"118","author":"Nakprasit","year":"2015","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2026.02.040_b15","series-title":"Strong edge-coloring of graphs with maximum edge weight seven","author":"Wang","year":"2025"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001216?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001216?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T10:21:34Z","timestamp":1776075694000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26001216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":15,"alternative-id":["S0166218X26001216"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.02.040","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Planar graphs with Ore-degree at most seven is strongly 13-edge-colorable","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.02.040","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"}]}}