{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:16:29Z","timestamp":1787501789371,"version":"build-2736575974"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,4]],"date-time":"2007-01-04T00:00:00Z","timestamp":1167868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,1,4]],"date-time":"2007-01-04T00:00:00Z","timestamp":1167868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1007\/s10878-006-9038-0","type":"journal-article","created":{"date-parts":[[2007,1,3]],"date-time":"2007-01-03T15:00:14Z","timestamp":1167836414000},"page":"87-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":59,"title":["On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \u0394 (G) = 3"],"prefix":"10.1007","volume":"14","author":[{"given":"Haiying","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,1,4]]},"reference":[{"key":"9038_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/jgt.10076","volume":"42","author":"PN Balister","year":"2003","unstructured":"Balister PN, Riordan OM, Schelp RH (2003) Vertex distinguishing edge colorings of graphs. J Graph Theory 42:95\u2013109","journal-title":"J Graph Theory"},{"key":"9038_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0012-365X(01)00287-4","volume":"252","author":"PN Balister","year":"2002","unstructured":"Balister PN, Bollobas B, Schelp RH (2002) Vertex distinguishing colorings of graphs with \u0394(G) = 2. Discrete Math 252:17\u201329","journal-title":"Discrete Math"},{"key":"9038_CR3","first-page":"73","volume":"21","author":"AC Burns","year":"1997","unstructured":"Burns AC, Schelp RH (1997) Vertex-distinguishing proper edge-coloring. J Graph Theory 21:73\u201382","journal-title":"J Graph Theory"},{"key":"9038_CR4","doi-asserted-by":"crossref","unstructured":"Wang H, The adjacent vertex-distinguishing total chromatic number of 1\u2212tree, accepted by Ars Combinatoria","DOI":"10.1109\/ICBBE.2010.5515912"},{"issue":"3","key":"9038_CR5","first-page":"13","volume":"23","author":"Z Wang","year":"2004","unstructured":"Wang Z, Wang L, Wang J, Lu X, Zhang Z (2004) On adjacent vertex-distinguishing total coloring of \u03b8\u2212graph. J Lanzhou Jiaotong Univ (Nat Sci) 23(3):13\u201315","journal-title":"J Lanzhou Jiaotong Univ (Nat Sci)"},{"key":"9038_CR6","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/S0893-9659(02)80015-5","volume":"15","author":"Z Zhang","year":"2002","unstructured":"Zhang Z, Liu L, Wang J (2002) Adjacent strong edge coloring of graphs. Appl Math Lett 15:623\u2013626","journal-title":"Appl Math Lett"},{"key":"9038_CR7","first-page":"299","volume":"20","author":"D Zhang","year":"2000","unstructured":"Zhang D, Zhang Z (2000) The adjacent vertex-distinguishing edge coloring of 1\u2212tree. J Math Res Exposit 20:299\u2013305","journal-title":"J Math Res Exposit"},{"key":"9038_CR8","first-page":"574","volume":"34","author":"Z Zhang","year":"2004","unstructured":"Zhang Z, Chen X, Li J, Yao B, Lu X, Wang J (2004) On the adjacent vertex-distinguishing total coloring of graphs. Sci China Ser A Math 34:574\u2013583","journal-title":"Sci China Ser A Math"},{"issue":"6","key":"9038_CR9","first-page":"143","volume":"23","author":"Z Zhang","year":"2004","unstructured":"Zhang Z, Yao B, Chen X, Wang W (2004) A note on the upper bound of adjacent vertex-distinguishing chromatic number of graphs. J Lanzhou Jiaotong Univ (Nat Sci) 23(6):143\u2013145","journal-title":"J Lanzhou Jiaotong Univ (Nat Sci)"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9038-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-006-9038-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9038-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9038-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T14:44:29Z","timestamp":1736693069000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-006-9038-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,4]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,7]]}},"alternative-id":["9038"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-9038-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,4]]},"assertion":[{"value":"4 January 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}