{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:54:52Z","timestamp":1781463292347,"version":"3.54.1"},"reference-count":26,"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\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","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.028","type":"journal-article","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T09:44:34Z","timestamp":1777974274000},"page":"24-27","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A short proof that every claw-free cubic graph is (1,1,2,2)-packing colorable"],"prefix":"10.1016","volume":"391","author":[{"given":"Maidoun","family":"Mortada","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ayman","family":"El Zein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.dam.2026.04.028_b1","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":"2","key":"10.1016\/j.dam.2026.04.028_b2","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s00373-019-02016-3","article-title":"Packing chromatic number of subdivisions of cubic graphs","volume":"35","author":"Balogh","year":"2019","journal-title":"Graphs Combin."},{"issue":"8","key":"10.1016\/j.dam.2026.04.028_b3","doi-asserted-by":"crossref","first-page":"2337","DOI":"10.1016\/j.disc.2018.05.004","article-title":"An infinite family of subcubic graphs with unbounded packing chromatic number","volume":"341","author":"Bre\u0161ar","year":"2018","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.dam.2026.04.028_b4","doi-asserted-by":"crossref","first-page":"923","DOI":"10.7151\/dmgt.2320","article-title":"A survey on packing colorings","volume":"40","author":"Bre\u0161ar","year":"2020","journal-title":"Discuss. Math. Graph Theory"},{"issue":"5","key":"10.1016\/j.dam.2026.04.028_b5","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.028_b6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s00010-016-0461-8","article-title":"Packing chromatic number, (1,1,2,2)-colorings, and characterizing the Petersen graph","volume":"91","author":"Bre\u0161ar","year":"2017","journal-title":"Aequationes Math."},{"key":"10.1016\/j.dam.2026.04.028_b7","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":"8","key":"10.1016\/j.dam.2026.04.028_b8","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2025.114477","article-title":"Claw-free cubic graphs are (1,1,2,2)-colorable","volume":"348","author":"Bre\u0161ar","year":"2025","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.028_b9","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.028_b10","first-page":"33","article-title":"Broadcast chromatic numbers of graphs","volume":"86","author":"Goddard","year":"2008","journal-title":"Ars Combin."},{"issue":"3","key":"10.1016\/j.dam.2026.04.028_b11","first-page":"666","article-title":"Packing coloring of some undirected and oriented coronae graphs","volume":"37","author":"Laiche","year":"2017","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2026.04.028_b12","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1016\/j.dam.2020.03.015","article-title":"Packing (1,1,2,2)-coloring of some subcubic graphs","volume":"283","author":"Liu","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.04.028_b13","series-title":"Partition subcubic planar graphs into independent sets","author":"Liu","year":"2024"},{"issue":"11","key":"10.1016\/j.dam.2026.04.028_b14","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2025.114610","article-title":"Every subcubic graph is packing (1,1,2,2,3)-colorable","volume":"348","author":"Liu","year":"2025","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.028_b15","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.dam.2024.07.041","article-title":"About S-packing coloring of 3-irregular subcubic graphs","volume":"359","author":"Mortada","year":"2024","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.04.028_b16","unstructured":"M. Mortada, O. Togni, On S-Packing Coloring of Bounded Degree Graphs, http:\/\/dx.doi.org\/10.48550\/arXiv.2503.18793."},{"issue":"2","key":"10.1016\/j.dam.2026.04.028_b17","first-page":"155","article-title":"About S-packing coloring of 2-saturated subcubic graphs","volume":"90","author":"Mortada","year":"2024","journal-title":"Australas. J Comb."},{"issue":"5","key":"10.1016\/j.dam.2026.04.028_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.113917","article-title":"About S-packing coloring of subcubic graphs","volume":"347","author":"Mortada","year":"2024","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.dam.2026.04.028_b19","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.114376","article-title":"Further results and questions on S-packing coloring of subcubic graphs","volume":"348","author":"Mortada","year":"2025","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.028_b20","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.dam.2026.03.007","article-title":"On the (1, 1, 2, 3)-packing coloring of some subcubic graphs","volume":"388","author":"Mortada","year":"2026","journal-title":"Discrete Appl. Math."},{"issue":"31","key":"10.1016\/j.dam.2026.04.028_b21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.dam.2024.02.002","article-title":"S-Packing coloring of cubic Halin graphs","volume":"349","author":"Tarhini","year":"2024","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.04.028_b22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2023.03.001","article-title":"On packing S-colorings of subcubic graphs","volume":"334","author":"Yang","year":"2023","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.04.028_b23","unstructured":"A.E. Zein, M. Mortada, Advances on the packing coloring conjectures of subcubic graphs, https:\/\/arxiv.org\/abs\/2503.20239."},{"key":"10.1016\/j.dam.2026.04.028_b24","unstructured":"A.E. Zein, M. Mortada, On the impact of local girth on S-packing colorings of subcubic graphs, https:\/\/arxiv.org\/abs\/2603.25113."},{"key":"10.1016\/j.dam.2026.04.028_b25","series-title":"A step toward an S-packing coloring conjecture for subcubic graphs","author":"Zein","year":"2026"},{"key":"10.1016\/j.dam.2026.04.028_b26","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.dam.2026.02.031","article-title":"Fast algorithm for S-packing coloring of Halin graphs","volume":"387","author":"Zhang","year":"2026","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002489?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002489?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:43Z","timestamp":1781460403000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26002489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":26,"alternative-id":["S0166218X26002489"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.028","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":"A short proof that every claw-free cubic graph is -packing colorable","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.028","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}