{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:30:33Z","timestamp":1725579033812},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_11","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T04:03:12Z","timestamp":1300075392000},"page":"103-106","source":"Crossref","is-referenced-by-count":0,"title":["The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most \u0394\u2009+\u20092"],"prefix":"10.1007","author":[{"given":"Toru","family":"Hasunuma","sequence":"first","affiliation":[]},{"given":"Toshimasa","family":"Ishii","sequence":"additional","affiliation":[]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[]},{"given":"Yushi","family":"Uno","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"2141","DOI":"10.1016\/j.disc.2005.12.059","volume":"307","author":"F. Bazzaro","year":"2007","unstructured":"Bazzaro, F., Montassier, M., Raspaud, A.: (d,1)-total labelling of planar graphs with large girth and high maximum degree. Discr. Math.\u00a0307, 2141\u20132151 (2007)","journal-title":"Discr. Math."},{"unstructured":"Behzad, M.: Graphs and their chromatic numbers. Ph.D. Thesis, Michigan State University (1965)","key":"11_CR2"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1093\/comjnl\/bxl018","volume":"49","author":"T. Calamoneri","year":"2006","unstructured":"Calamoneri, T.: The L(h,k)-labelling problem: A survey and annotated bibliography. The Computer Journal\u00a049, 585\u2013608 (2006) (Updated version) (ver. October 19, 2009), \n                  \n                    http:\/\/www.dsi.uniroma1.it\/~calamo\/PDF-FILES\/survey.pdf","journal-title":"The Computer Journal"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"2585","DOI":"10.1016\/j.dam.2007.07.016","volume":"155","author":"D. Chen","year":"2007","unstructured":"Chen, D., Wang, W.: (2,1)-Total labelling of outerplanar graphs. Discr. Appl. Math.\u00a0155, 2585\u20132593 (2007)","journal-title":"Discr. Appl. Math."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J.R. Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. Disc. Math.\u00a05, 586\u2013595 (1992)","journal-title":"SIAM J. Disc. Math."},{"unstructured":"Hasunuma, T., Ishii, T., Ono, H., Uno, Y.: A tight upper bound on the (2,1)-total labeling number of outerplanar graphs. CoRR abs\/0911.4590 (2009)","key":"11_CR6"},{"unstructured":"Havet, F., Yu, M.-L.: (d,1)-Total labelling of graphs. Technical Report 4650, INRIA (2002)","key":"11_CR7"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1016\/j.disc.2007.03.034","volume":"308","author":"F. Havet","year":"2008","unstructured":"Havet, F., Yu, M.-L.: (p,1)-Total labelling of graphs. Discr. Math.\u00a0308, 496\u2013513 (2008)","journal-title":"Discr. Math."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"3767","DOI":"10.1016\/j.disc.2008.10.008","volume":"309","author":"K.-W. Lih","year":"2009","unstructured":"Lih, K.-W., Liu, D.D.-F., Wang, W.: On (d,1)-total numbers of graphs. Discr. Math.\u00a0309, 3767\u20133773 (2009)","journal-title":"Discr. Math."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1002\/jgt.20124","volume":"51","author":"M. Montassier","year":"2006","unstructured":"Montassier, M., Raspaud, A.: (d,1)-total labeling of graphs with a given maximum average degree. J. Graph Theory\u00a051, 93\u2013109 (2006)","journal-title":"J. Graph Theory"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1070\/RM1968v023n06ABEH001252","volume":"23","author":"V.G. Vizing","year":"1968","unstructured":"Vizing, V.G.: Some unsolved problems in graph theory. Russian Mathematical Surveys\u00a023, 125\u2013141 (1968)","journal-title":"Russian Mathematical Surveys"},{"key":"11_CR12","first-page":"236","volume":"22","author":"W. Wang","year":"1999","unstructured":"Wang, W., Zhang, K.: \u0394-Matchings and edge-face chromatic numbers. Acta. Math. Appl. Sinica\u00a022, 236\u2013242 (1999)","journal-title":"Acta. Math. Appl. Sinica"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/S0895480192242821","volume":"8","author":"M.A. Whittlesey","year":"1995","unstructured":"Whittlesey, M.A., Georges, J.P., Mauro, D.W.: On the \u03bb- number of Q\n                  n\n                 and related graphs. SIAM J. Discr. Math.\u00a08, 499\u2013506 (1995)","journal-title":"SIAM J. Discr. Math."},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/j.disc.2005.11.029","volume":"306","author":"R.K. Yeh","year":"2006","unstructured":"Yeh, R.K.: A survey on labeling graphs with a condition at distance two. Discr. Math.\u00a0306, 1217\u20131231 (2006)","journal-title":"Discr. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:34:35Z","timestamp":1558420475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}