{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:21:43Z","timestamp":1725571303587},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_5","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:09:23Z","timestamp":1291406963000},"page":"49-60","source":"Crossref","is-referenced-by-count":0,"title":["The (p,q)-total Labeling Problem for Trees"],"prefix":"10.1007","author":[{"given":"Toru","family":"Hasunuma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshimasa","family":"Ishii","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yushi","family":"Uno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_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."},{"key":"5_CR2","unstructured":"Behzad, M.: Graphs and their chromatic numbers. Ph.D. Thesis, Michigan State University (1965)"},{"key":"5_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) (The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography, \n                    \n                      http:\/\/www.dsi.uniroma1.it\/~calamo\/PDF-FILES\/survey.pdf\n                    \n                    \n                  , ver. October 19, 2009)","journal-title":"The Computer Journal"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0012-365X(99)00400-8","volume":"220","author":"G.J. Chang","year":"2000","unstructured":"Chang, G.J., Ke, W.-T., Kuo, D., Liu, D.D.-F., Yeh, R.K.: On L(d,1)-labeling of graphs. Discr. Math.\u00a0220, 57\u201366 (2000)","journal-title":"Discr. Math."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"G.J. Chang","year":"1996","unstructured":"Chang, G.J., Kuo, D.: The L(2,1)-labeling problem on graphs. SIAM J. Discr. Math.\u00a09, 309\u2013316 (1996)","journal-title":"SIAM J. Discr. Math."},{"key":"5_CR6","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":"5_CR7","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.disc.2008.09.021","volume":"310","author":"L. Dekar","year":"2010","unstructured":"Dekar, L., Effantin, B., Kheddouci, H.: [r,s,t]-coloring of trees and bipartite graphs. Discr. Math.\u00a0310, 260\u2013269 (2010)","journal-title":"Discr. Math."},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-70575-8_25","volume-title":"Automata, Languages and Programming","author":"J. Fiala","year":"2008","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Computational Complexity of the Distance Constrained Labeling Problem for Trees. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 294\u2013305. Springer, Heidelberg (2008)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0095-8956(75)90060-X","volume":"18","author":"S. Fiorini","year":"1975","unstructured":"Fiorini, S.: On the chromatic index of outerplanar graphs. J. Combin. Theory Ser. B\u00a018, 35\u201338 (1975)","journal-title":"J. Combin. Theory Ser. B"},{"key":"5_CR10","first-page":"141","volume":"109","author":"J.P. Georges","year":"1995","unstructured":"Georges, J.P., Mauro, D.W.: Generalized vertex labeling with a condition at distance two. Congr. Numer.\u00a0109, 141\u2013159 (1995)","journal-title":"Congr. Numer."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0012-365X(02)00750-1","volume":"269","author":"J.P. Georges","year":"2003","unstructured":"Georges, J.P., Mauro, D.W.: Labeling trees with a condition at distance two. Discr. Math.\u00a0269, 127\u2013148 (2003)","journal-title":"Discr. Math."},{"key":"5_CR12","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. Discr. Math.\u00a05, 586\u2013595 (1992)","journal-title":"SIAM J. Discr. Math."},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-04128-0_4","volume-title":"Algorithms - ESA 2009","author":"T. Hasunuma","year":"2009","unstructured":"Hasunuma, T., Ishii, T., Ono, H., Uno, Y.: A linear time algorithm for L(2,1)-labeling of trees. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 35\u201346. Springer, Heidelberg (2009)"},{"key":"5_CR14","unstructured":"Hasunuma, T., Ishii, T., Ono, H., Uno, Y.: A tight upper bound on the (2,1)-total labeling number of outerplanar graphs. In: CoRR abs\/0911.4590 (2009)"},{"key":"5_CR15","unstructured":"Havet, F., Yu, M.-L.: (d,1)-Total labelling of graphs. Technical Report 4650, INRIA (2002)"},{"key":"5_CR16","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":"5_CR17","doi-asserted-by":"publisher","first-page":"2859","DOI":"10.1016\/j.dam.2009.03.021","volume":"157","author":"F. Havet","year":"2009","unstructured":"Havet, F., Thomass\u00e9, S.: Complexity of (p,1)-total labelling. Discr. Appl. Math.\u00a0157, 2859\u20132870 (2009)","journal-title":"Discr. Appl. Math."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.disc.2006.06.030","volume":"307","author":"A. Kemnitz","year":"2007","unstructured":"Kemnitz, A., Marangio, M.: [r,s,t]-Colorings of graphs. Discr. Math.\u00a0307, 199\u2013207 (2007)","journal-title":"Discr. Math."},{"key":"5_CR19","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":"5_CR20","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":"5_CR21","unstructured":"Vill\u00e0, M.S.: [r,s,t]-colourings of paths, cycles and stars. Doctoral Thesis, TU Bergakademie, Freiberg (2005)"},{"key":"5_CR22","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":"5_CR23","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.ipl.2009.03.027","volume":"109","author":"W. Wang","year":"2009","unstructured":"Wang, W., Chen, D.: (2,1)-Total number of trees maximum degree three. Inf. Process. Lett.\u00a0109, 805\u2013810 (2009)","journal-title":"Inf. Process. Lett."},{"key":"5_CR24","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 Qn and related graphs. SIAM J. Discr. Math.\u00a08, 499\u2013506 (1995)","journal-title":"SIAM J. Discr. Math."},{"key":"5_CR25","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."},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.jda.2003.12.006","volume":"3","author":"X. Zhou","year":"2005","unstructured":"Zhou, X., Matsuo, Y., Nishizeki, T.: List total colorings of series-parallel graphs. J. Discr. Algorithms\u00a03, 47\u201360 (2005)","journal-title":"J. Discr. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T21:20:09Z","timestamp":1548451209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}