{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:43:28Z","timestamp":1725543808779},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354741"},{"type":"electronic","value":"9783540354758"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780823_21","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T14:45:59Z","timestamp":1151073959000},"page":"268-279","source":"Crossref","is-referenced-by-count":1,"title":["L(h,1,1)-Labeling of Outerplanar Graphs"],"prefix":"10.1007","author":[{"given":"Tiziana","family":"Calamoneri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuele G.","family":"Fusco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard B.","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Vocca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Agnarsson, G., Halld\u00f3rsson, M.: Coloring Powers of planar graphs. In: Proc. 11th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 654\u2013662 (2000)"},{"issue":"3","key":"21_CR2","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1109\/TPDS.2003.1189581","volume":"14","author":"A.A. Bertossi","year":"2003","unstructured":"Bertossi, A.A., Pinotti, C.M., Tan, R.B.: Channel assignment with separation for interference avoidance in wireless networks. IEEE Transactions on Parallel and Distributed Systems\u00a014(3), 222\u2013235 (2003), Preliminary version in ACM Workshop DIAL M 2000 (2000)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1093\/comjnl\/47.2.193","volume":"47","author":"H.L. Bodlaender","year":"2004","unstructured":"Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: Approximations for \u03bb-Colorings of Graphs.The Computer Journal\u00a047, 193\u2013204 (2004), Preliminary version in Proc. 17th Annual Symp. on Theoretical Aspects of Computer Science (STACS 2000), LNCS, vol. 1770, pp. 395\u2013406 (2000)","journal-title":"The Computer Journal"},{"key":"21_CR4","unstructured":"Bruce, R.J., Hoffmann, M.: L(p,q)-labeling of outerplanar graphs. Tech. Rep. No, 2003\/9, Department of Mathematics and Computer Science, University of Leicester, England"},{"key":"21_CR5","unstructured":"Calamoneri, T.: The L(h,k)-labeling problem: an annotated bibliography. In: The Computer Journal (accepted 2006), A continuously updated version is available online at \n                  \n                    http:\/\/www.dsi.uniroma1.it\/~calamo\/survey.html"},{"issue":"3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/j.jpdc.2003.11.005","volume":"64","author":"T. Calamoneri","year":"2004","unstructured":"Calamoneri, T., Petreschi, R.: L(h,1)-Labeling Subclasses of Planar Graphs. Journal on Parallel and Distributed Computing\u00a064(3), 414\u2013426 (2004)","journal-title":"Journal on Parallel and Distributed Computing"},{"key":"21_CR7","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.: Labeling graphs with a Condition at Distance 2. SIAM J. Disc. Math\u00a05, 586\u2013595 (1992)","journal-title":"SIAM J. Disc. Math"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W.K. Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE\u00a068, 1497\u20131514 (1980)","journal-title":"Proc. IEEE"},{"key":"21_CR9","unstructured":"Jonas, K.: Graph Coloring Analogues With a Condition at Distance Two: L(2,1)-Labelings and List \u03bb-Labelings. Ph.D. thesis, University of South Carolina, Columbia (1993)"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02592052","volume":"26","author":"S.T. McCormick","year":"1983","unstructured":"McCormick, S.T.: Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Math. Programming\u00a026, 153\u2013171 (1983)","journal-title":"Math. Programming"},{"key":"21_CR11","unstructured":"Yeh, R.K.: A Survey on Labeling Graphs with a Condition at Distance Two (manuscript 2004)"},{"key":"21_CR12","unstructured":"Yeh, R.K.: Labeling Graphs with a Condition at Distance Two. Ph.D. Thesis, University of South Carolina (1990)"},{"key":"21_CR13","first-page":"671","volume":"E83-A","author":"X. Zhou","year":"2000","unstructured":"Zhou, X., Kanari, Y., Nishizeki, T.: Generalized vertex-coloring of partial k-trees. IEICE Trans. Fundamentals of Electronics, Communication and Computer Sciences\u00a0E83-A, 671\u2013678 (2000)","journal-title":"IEICE Trans. Fundamentals of Electronics, Communication and Computer Sciences"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780823_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:12Z","timestamp":1619507832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11780823_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}