{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T04:40:47Z","timestamp":1649133647884},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,9,30]],"date-time":"2014-09-30T00:00:00Z","timestamp":1412035200000},"content-version":"tdm","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":[[2016,2]]},"DOI":"10.1007\/s10878-014-9794-1","type":"journal-article","created":{"date-parts":[[2014,9,29]],"date-time":"2014-09-29T15:37:16Z","timestamp":1412005036000},"page":"893-901","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A sufficient condition for a tree to be $$(\\Delta +1)$$ ( \u0394 + 1 ) - $$(2,1)$$ ( 2 , 1 ) -totally labelable"],"prefix":"10.1007","volume":"31","author":[{"given":"Zhengke","family":"Miao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiaojun","family":"Shu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weifan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,30]]},"reference":[{"key":"9794_CR1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"GJ Chang","year":"1996","unstructured":"Chang GJ, Kuo D (1996) The $$L(2, 1)$$ L ( 2 , 1 ) -labelling problem on graphs. SIAM J Discret Math 9:309\u2013316","journal-title":"SIAM J Discret Math"},{"key":"9794_CR2","doi-asserted-by":"crossref","first-page":"2585","DOI":"10.1016\/j.dam.2007.07.016","volume":"155","author":"D Chen","year":"2007","unstructured":"Chen D, Wang W (2007) $$(2, 1)$$ ( 2 , 1 ) -Total labelling of outerplanar graphs. Discret Appl Math 155:2585\u20132593","journal-title":"Discret Appl Math"},{"key":"9794_CR3","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs JR, Yeh RK (1992) Labelling graphs with a condition at distance $$2$$ 2 . SIAM J Discret Math 5:586\u2013595","journal-title":"SIAM J Discret Math"},{"key":"9794_CR4","doi-asserted-by":"crossref","first-page":"3702","DOI":"10.1016\/j.tcs.2009.04.025","volume":"410","author":"T Hasunuma","year":"2009","unstructured":"Hasunuma T, Ishii T, Ono H, Uno Y (2009) An $$O(n^{1.75})$$ O ( n 1.75 ) algorithm for $$L(2, 1)$$ L ( 2 , 1 ) -labeling of trees. Theor Comput Sci 410:3702\u20133710","journal-title":"Theor Comput Sci"},{"key":"9794_CR5","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1016\/j.disc.2012.01.007","volume":"312","author":"T Hasunuma","year":"2012","unstructured":"Hasunuma T, Ishii T, Ono H, Uno Y (2012) The $$(p, q)$$ ( p , q ) -total labeling problem for trees. Discret Math 312:1407\u20131420","journal-title":"Discret Math"},{"key":"9794_CR6","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1016\/j.disc.2007.03.034","volume":"308","author":"F Havet","year":"2008","unstructured":"Havet F, Yu ML (2008) $$(p, 1)$$ ( p , 1 ) -Total labelling of graphs. Discret Math 308:496\u2013513","journal-title":"Discret Math"},{"key":"9794_CR7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.ipl.2008.10.001","volume":"109","author":"J Huang","year":"2009","unstructured":"Huang J, Sun H, Wang W, Chen D (2009) $$(2, 1)$$ ( 2 , 1 ) -Total labelling of trees with sparse vertices of maximum degree. Inform Process Lett 109:199\u2013203","journal-title":"Inform Process Lett"},{"key":"9794_CR8","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1137\/050632609","volume":"22","author":"JH Kang","year":"2008","unstructured":"Kang JH (2008) $$L(2, 1)$$ L ( 2 , 1 ) -labeling of Hamiltonian graphs with maximum degree 3. SIAM J Discret Math 22:213\u2013230","journal-title":"SIAM J Discret Math"},{"key":"9794_CR9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.disc.2006.05.035","volume":"307","author":"A Kemnitz","year":"2007","unstructured":"Kemnitz A, Marangio M (2007) $$[r, s, t]$$ [ r , s , t ] -Colorings of graphs. Discret Math 307:119\u2013207","journal-title":"Discret Math"},{"key":"9794_CR10","doi-asserted-by":"crossref","first-page":"3767","DOI":"10.1016\/j.disc.2008.10.008","volume":"309","author":"K-W Lih","year":"2009","unstructured":"Lih K-W, Liu DD-F, Wang W (2009) On $$(d, 1)$$ ( d , 1 ) -total numbers of graphs. Discret Math 309:3767\u20133773","journal-title":"Discret Math"},{"key":"9794_CR11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.jctb.2004.12.005","volume":"94","author":"M Molloy","year":"2005","unstructured":"Molloy M, Salavatipour MR (2005) A bound on the chromatic number of the square of a planar graph. J Comb Theory Ser B 94:189\u2013213","journal-title":"J Comb Theory Ser B"},{"key":"9794_CR12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1002\/jgt.20124","volume":"51","author":"M Montassier","year":"2006","unstructured":"Montassier M, Raspaud A (2006) $$(d, 1)$$ ( d , 1 ) -Total labelling of graphs with a given maximum average degree. J Graph Theory 51:93\u2013109","journal-title":"J Graph Theory"},{"key":"9794_CR13","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/S0895480192242821","volume":"8","author":"MA Whittlesey","year":"1995","unstructured":"Whittlesey MA, Georges JP, Mauro DW (1995) On the $$\\lambda $$ \u03bb -number of $$Q_n$$ Q n and related graphs. SIAM J Discret Math 8:499\u2013506","journal-title":"SIAM J Discret Math"},{"key":"9794_CR14","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/S0895480101390448","volume":"17","author":"W Wang","year":"2004","unstructured":"Wang W, Lih K-W (2004) Labelling planar graphs with conditions on girth and distance two. SIAM J Discret Math 17:264\u2013275","journal-title":"SIAM J Discret Math"},{"key":"9794_CR15","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/j.dam.2005.09.007","volume":"154","author":"W Wang","year":"2006","unstructured":"Wang W (2006) The $$L(2, 1)$$ L ( 2 , 1 ) -labelling of trees. Discret Appl Math 154:598\u2013603","journal-title":"Discret Appl Math"},{"key":"9794_CR16","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1016\/j.ipl.2009.03.027","volume":"109","author":"W Wang","year":"2009","unstructured":"Wang W, Chen D (2009) $$(2, 1)$$ ( 2 , 1 ) -Total number of trees with maximum degree three. Inf Process Lett 109:805\u2013810","journal-title":"Inf Process Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9794-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9794-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9794-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:24Z","timestamp":1559276604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9794-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,30]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["9794"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9794-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,30]]}}}