{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:15:36Z","timestamp":1754108136280},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T00:00:00Z","timestamp":1571702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T00:00:00Z","timestamp":1571702400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10878-019-00465-3","type":"journal-article","created":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T04:30:17Z","timestamp":1571805017000},"page":"246-272","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve"],"prefix":"10.1007","volume":"39","author":[{"given":"Jingjing","family":"Huo","sequence":"first","affiliation":[]},{"given":"Yiqiao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Weifan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wenjing","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,22]]},"reference":[{"key":"465_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N Alon","year":"1999","unstructured":"Alon N (1999) Combinatorial Nullstellensatz. Comb Probab Comput 8:7\u201329","journal-title":"Comb Probab Comput"},{"key":"465_CR2","doi-asserted-by":"publisher","first-page":"4003","DOI":"10.1016\/j.disc.2007.07.091","volume":"308","author":"X Chen","year":"2008","unstructured":"Chen X (2008) On the adjacent vertex distinguishing total coloring numbers of graphs with $$\\Delta =3$$. Discrete Math 308:4003\u20134007","journal-title":"Discrete Math"},{"key":"465_CR3","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10878-016-9995-x","volume":"34","author":"X Cheng","year":"2017","unstructured":"Cheng X, Wang G, Wu J (2017) The adjacent vertex distinguishing total chromatic numbers of planar graphs with $$\\Delta =10$$. J Comb Optim 34:383\u2013397","journal-title":"J Comb Optim"},{"key":"465_CR4","doi-asserted-by":"publisher","first-page":"2741","DOI":"10.1016\/j.disc.2012.04.006","volume":"312","author":"T Coker","year":"2012","unstructured":"Coker T, Johannson K (2012) The adjacent vertex distinguishing total chromatic number. Discrete Math 312:2741\u20132750","journal-title":"Discrete Math"},{"key":"465_CR5","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1360\/012011-359","volume":"42","author":"D Huang","year":"2012","unstructured":"Huang D, Wang W (2012) Adjacent vertex distinguishing total colorings of planar graphs with large maximum degree. Sci Sin Math 42:151\u2013164","journal-title":"Sci Sin Math"},{"key":"465_CR6","doi-asserted-by":"publisher","first-page":"3544","DOI":"10.1016\/j.disc.2012.08.006","volume":"312","author":"D Huang","year":"2012","unstructured":"Huang D, Wang W, Yan C (2012) A note on the adjacent vertex distinguishing total chromatic number of graphs. Discrete Math 312:3544\u20133546","journal-title":"Discrete Math"},{"key":"465_CR7","doi-asserted-by":"publisher","first-page":"2548","DOI":"10.1016\/j.disc.2008.06.002","volume":"309","author":"J Hulgan","year":"2009","unstructured":"Hulgan J (2009) Concise proofs for adjacent vertex-distinguishing total colorings. Discrete Math 309:2548\u20132550","journal-title":"Discrete Math"},{"key":"465_CR8","doi-asserted-by":"publisher","first-page":"3044","DOI":"10.1016\/j.disc.2018.07.011","volume":"314","author":"J Huo","year":"2018","unstructured":"Huo J, Wang W, Wang Y (2018) A characterization for the neighbor-distinguishing total chromatic number of planar graphs with $$\\Delta =13$$. Discrete Math 314:3044\u20133056","journal-title":"Discrete Math"},{"key":"465_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.disc.2016.07.011","volume":"340","author":"Y Lu","year":"2017","unstructured":"Lu Y, Li J, Luo R, Miao Z (2017) Adjacent vertex distinguishing total coloring of graphs with maximum degree 4. Discrete Math 340:119\u2013123","journal-title":"Discrete Math"},{"key":"465_CR10","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1016\/j.dam.2016.09.041","volume":"217","author":"A Luiz","year":"2017","unstructured":"Luiz A, Campos C, de Mello C (2017) AVD-total-chromatic number of some families of graphs with $$\\Delta (G)=3$$. Discrete Appl Math 217:628\u2013638","journal-title":"Discrete Appl Math"},{"key":"465_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.disc.2014.03.019","volume":"330","author":"A Papaioannou","year":"2014","unstructured":"Papaioannou A, Raftopoulou C (2014) On the AVDTC of 4-regular graphs. Discrete Math 330:20\u201340","journal-title":"Discrete Math"},{"key":"465_CR12","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1016\/j.disc.2017.10.011","volume":"341","author":"B Vu\u010dkovi\u0107","year":"2018","unstructured":"Vu\u010dkovi\u0107 B (2018) An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs. Discrete Math 341:1472\u20131478","journal-title":"Discrete Math"},{"key":"465_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10878-006-9038-0","volume":"14","author":"H Wang","year":"2007","unstructured":"Wang H (2007) On the adjacent vertex distinguishing total chromatic number of the graphs with $$\\Delta (G)=3$$. J Comb Optim 14:87\u2013109","journal-title":"J Comb Optim"},{"key":"465_CR14","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10878-012-9527-2","volume":"27","author":"W Wang","year":"2014","unstructured":"Wang W, Huang D (2014) The adjacent vertex distinguishing total coloring of planar graphs. J Comb Optim 27:379\u2013396","journal-title":"J Comb Optim"},{"key":"465_CR15","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1007\/s10878-018-0334-2","volume":"37","author":"W Wang","year":"2019","unstructured":"Wang W, Huo J, Huang D, Wang Y (2019) Planar graphs with $$\\Delta =9$$ are neighbor-distinguishing totally 12-colorable. J Comb Optim 37:1071\u20131089","journal-title":"J Comb Optim"},{"key":"465_CR16","first-page":"456","volume":"314","author":"D Yang","year":"2017","unstructured":"Yang D, Sun L, Yu X, Wu J, Zhou S (2017) Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10. Appl Math Comput 314:456\u2013468","journal-title":"Appl Math Comput"},{"key":"465_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1360\/03YS0207","volume":"48","author":"Z Zhang","year":"2005","unstructured":"Zhang Z, Chen X, Li J, Yao B, Lu X, Wang J (2005) On adjacent-vertex-distinguishing total coloring of graphs. Sci China Ser A 48:289\u2013299","journal-title":"Sci China Ser A"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00465-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00465-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00465-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T23:12:24Z","timestamp":1603235544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00465-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,22]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["465"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00465-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,22]]},"assertion":[{"value":"22 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}