{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:46Z","timestamp":1740107146132,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T00:00:00Z","timestamp":1538956800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.11171114","No. 11401576"],"award-info":[{"award-number":["No.11171114","No. 11401576"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00373-018-1959-8","type":"journal-article","created":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T07:08:50Z","timestamp":1538982530000},"page":"1325-1332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note on Decycling Number, Vertex Partition and AVD-Total Coloring in Graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Chao","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erling","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,8]]},"reference":[{"key":"1959_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/(SICI)1097-0118(199705)25:1<59::AID-JGT4>3.0.CO;2-H","volume":"25","author":"L Beineke","year":"1997","unstructured":"Beineke, L., Vandell, R.: Decycling graphs. J. Graph Theory 25, 59\u201377 (1997)","journal-title":"J. Graph Theory"},{"key":"1959_CR2","doi-asserted-by":"publisher","first-page":"4003","DOI":"10.1016\/j.disc.2007.07.091","volume":"308","author":"X Chen","year":"2009","unstructured":"Chen, X.: On the adjacent vertex distinguishing total coloring numbers of graphs with \n                    \n                      \n                    \n                    $$\\Delta (G)=3$$\n                    \n                      \n                        \n                          \u0394\n                          (\n                          G\n                          )\n                          =\n                          3\n                        \n                      \n                    \n                  . Discrete Math. 308, 4003\u20134007 (2009)","journal-title":"Discrete Math."},{"key":"1959_CR3","volume-title":"Graph theory","author":"F Harary","year":"1967","unstructured":"Harary, F.: Graph theory. Academic Press, New York (1967)"},{"key":"1959_CR4","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.: A note on the adjacent vertex distinguishing total chromatic number of graphs. Discrete Math. 312, 3544\u20133546 (2012)","journal-title":"Discrete Math."},{"key":"1959_CR5","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.: Concise proofs for adjacent vertex-distinguishing total colorings. Discrete Math. 309, 2548\u20132550 (2009)","journal-title":"Discrete Math."},{"key":"1959_CR6","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems, complexity of computer computations. In: Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights. Plenum, New York, pp 85-103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"1959_CR7","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1137\/S089548010444016X","volume":"19","author":"D Pike","year":"2005","unstructured":"Pike, D., Zou, Y.: Decycling Cartesian products of two cycles. SIAM J. Discrete Math. 19, 651\u2013663 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"1959_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10878-006-9038-0","volume":"14","author":"H Wang","year":"2007","unstructured":"Wang, H.: On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \n                    \n                      \n                    \n                    $$\\Delta (G)=3$$\n                    \n                      \n                        \n                          \u0394\n                          (\n                          G\n                          )\n                          =\n                          3\n                        \n                      \n                    \n                  . J. Comb. Optim. 14, 87\u2013109 (2007)","journal-title":"J. Comb. Optim."},{"key":"1959_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0095-8956(79)90058-3","volume":"26","author":"N Xuong","year":"1979","unstructured":"Xuong, N.: How to determine the maximum genus of a graph. J. Combin. Theory Ser. B 26, 217\u2013225 (1979)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1959_CR10","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., Lv, X., Wang, J.: On adjacent-vertex-distinguishing total coloring of graphs. Sci. China Ser. A 48, 289\u2013299 (2005)","journal-title":"Sci. China Ser. A"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1959-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1959-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1959-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T19:15:48Z","timestamp":1570475748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1959-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,8]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1959"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1959-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,10,8]]},"assertion":[{"value":"21 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}