{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T09:10:20Z","timestamp":1778490620574,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12471333"],"award-info":[{"award-number":["12471333"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12261055"],"award-info":[{"award-number":["12261055"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11961041"],"award-info":[{"award-number":["11961041"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004775","name":"Natural Science Foundation of Gansu Province","doi-asserted-by":"publisher","award":["24JRRA222"],"award-info":[{"award-number":["24JRRA222"]}],"id":[{"id":"10.13039\/501100004775","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,8]]},"DOI":"10.1016\/j.dam.2026.03.034","type":"journal-article","created":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:05:56Z","timestamp":1775016356000},"page":"46-57","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On the neighbor full sum distinguishing total coloring of graphs"],"prefix":"10.1016","volume":"389","author":[{"given":"Fei","family":"Wen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongzheng","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zepeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong-Jian","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1\u20132","key":"10.1016\/j.dam.2026.03.034_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."},{"key":"10.1016\/j.dam.2026.03.034_b2","series-title":"Graphs and their chromatic numbers","author":"Behzad","year":"1965"},{"issue":"01","key":"10.1016\/j.dam.2026.03.034_b3","first-page":"149","article-title":"Neighbor full sum distinguishing total coloring of graphs","volume":"27","author":"Cui","year":"2023","journal-title":"Oper. Res. Trans."},{"key":"10.1016\/j.dam.2026.03.034_b4","doi-asserted-by":"crossref","first-page":"1919","DOI":"10.1007\/s40840-020-01033-3","article-title":"Neighbor sum distinguishing total colorings of corona of subcubic graphs","volume":"44","author":"Dong","year":"2021","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"10.1016\/j.dam.2026.03.034_b5","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/j.dam.2024.11.005","article-title":"Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles","volume":"361","author":"Duan","year":"2025","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2026.03.034_b6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.7151\/dmgt.1909","article-title":"A note on neighbor expanded sum distinguishing index","volume":"37","author":"Flandrin","year":"2017","journal-title":"Discuss. Math. Graph Theoty"},{"key":"10.1016\/j.dam.2026.03.034_b7","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/s10878-013-9660-6","article-title":"Neighbor sum distinguishing total colorings of planar graphs","volume":"30","author":"Li","year":"2015","journal-title":"J. Comb. Optim."},{"issue":"2","key":"10.1016\/j.dam.2026.03.034_b8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1002\/jgt.20124","article-title":"(d,1)\u2013total labeling of graphs with a given maximum average degree","volume":"51","author":"Montassier","year":"2006","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.dam.2026.03.034_b9","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1007\/s00373-013-1399-4","article-title":"On the total-neighbor-distinguishing index by sums","volume":"31","author":"Pil\u015bniak","year":"2015","journal-title":"Graphs Combin."},{"issue":"3","key":"10.1016\/j.dam.2026.03.034_b10","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/s10114-020-9189-4","article-title":"Neighbor sum distinguishing total coloring of triangle free IC-planar graphs","volume":"36","author":"Song","year":"2020","journal-title":"Acta Math. Sin. Engl. Ser."},{"key":"10.1016\/j.dam.2026.03.034_b11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.tcs.2016.06.007","article-title":"A note on the neighbor sum distinguishing total coloring of planar graphs","volume":"640","author":"Song","year":"2016","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.dam.2026.03.034_b12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10878-019-00467-1","article-title":"Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13","volume":"39","author":"Song","year":"2020","journal-title":"J. Comb. Optim."},{"issue":"1","key":"10.1016\/j.dam.2026.03.034_b13","doi-asserted-by":"crossref","first-page":"112190","DOI":"10.1016\/j.disc.2020.112190","article-title":"Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24","volume":"344","author":"Sun","year":"2021","journal-title":"Discrete Math."},{"issue":"6","key":"10.1016\/j.dam.2026.03.034_b14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1070\/RM1968v023n06ABEH001252","article-title":"Some unsolved problems in graph theory","volume":"23","author":"Vizing","year":"1968","journal-title":"Russian Math. Surveys"},{"issue":"4","key":"10.1016\/j.dam.2026.03.034_b15","doi-asserted-by":"crossref","first-page":"979","DOI":"10.11650\/twjm\/1500404991","article-title":"Adjacent vertex distinguishing total coloring of graphs with lower average degree","volume":"12","author":"Wang","year":"2008","journal-title":"Taiwanese J. Math."},{"key":"10.1016\/j.dam.2026.03.034_b16","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/j.amc.2017.06.002","article-title":"Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10","volume":"314","author":"Yang","year":"2017","journal-title":"Appl. Math. Comput."},{"issue":"7","key":"10.1016\/j.dam.2026.03.034_b17","doi-asserted-by":"crossref","first-page":"496","DOI":"10.3390\/axioms14070496","article-title":"Neighbor full sum distinguishing total coloring of planar graphs with girth at least 5","volume":"14","author":"Yue","year":"2025","journal-title":"Axioms"},{"issue":"1","key":"10.1016\/j.dam.2026.03.034_b18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11227-024-06825-z","article-title":"Neighbor full sum distinguishing total coloring of planar graphs","volume":"81","author":"Yue","year":"2025","journal-title":"J. Supercomput."},{"issue":"10","key":"10.1016\/j.dam.2026.03.034_b19","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.3390\/sym13101787","article-title":"On the total neighbor sum distinguishing index of IC-planar graphs","volume":"13","author":"Zhang","year":"2021","journal-title":"Symmetry"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001770?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001770?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T08:37:11Z","timestamp":1778488631000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26001770"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":19,"alternative-id":["S0166218X26001770"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.034","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the neighbor full sum distinguishing total coloring of graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.034","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"}]}}