乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:41:35Z","timestamp":1725579695776},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642197536"},{"type":"electronic","value":"9783642197543"}],"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"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","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-19754-3_8","type":"book-chapter","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T09:22:38Z","timestamp":1301304158000},"page":"57-68","source":"Crossref","is-referenced-by-count":1,"title":["L(2,1)-Labeling of Unigraphs"],"prefix":"10.1007","author":[{"given":"Tiziana","family":"Calamoneri","sequence":"first","affiliation":[]},{"given":"Rossella","family":"Petreschi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"8","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1677","DOI":"10.1016\/j.dam.2009.02.004","volume":"157","author":"T. Araki","year":"2009","unstructured":"Araki, T.: Labeling bipartite permutation graphs with a condition at distance two. Discrete Applied Mathematics\u00a0157(8), 1677\u20131686 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/3-540-46541-3_33","volume-title":"STACS 2000","author":"H.L. Bodlaender","year":"2000","unstructured":"Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: \u03bb-Coloring of Graphs. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 395\u2013406. Springer, Heidelberg (2000)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-00202-1_15","volume-title":"WALCOM: Algorithms and Computation","author":"A. Borri","year":"2009","unstructured":"Borri, A., Calamoneri, T., Petreschi, R.: Recognition of Unigraphs through Superposition of Graphs. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol.\u00a05431, pp. 165\u2013176. Springer, Heidelberg (2009)"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1002\/net.20257","volume":"53","author":"T. Calamoneri","year":"2009","unstructured":"Calamoneri, T., Caminiti, S., Olariu, S., Petreschi, R.: On the L(h,k)-labeling Co-Comparability graphs and Circular-Arc graphs. Networks\u00a053(1), 27\u201334 (2009)","journal-title":"Networks"},{"issue":"5","key":"8_CR5","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(5), 585\u2013608 (2006)","journal-title":"The Computer Journal"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"2445","DOI":"10.1016\/j.dam.2006.03.036","volume":"154","author":"T. Calamoneri","year":"2006","unstructured":"Calamoneri, T., Petreschi, R.: Lambda-Coloring Matrogenic Graphs. Discrete Applied Mathematics\u00a0154, 2445\u20132457 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"8_CR7","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"},{"unstructured":"Cerioli, M., Posner, D.: On L(2,1)-coloring P\n 4 tidy graphs. In: 8th French Combinatorial Conference (2010)","key":"8_CR8"},{"key":"8_CR9","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. Disc. Math.\u00a09, 309\u2013316 (1996)","journal-title":"SIAM J. Disc. Math."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-46784-X_33","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Fiala","year":"1999","unstructured":"Fiala, J., Kloks, T., Kratochv\u00edl, J.: Fixed-parameter Complexity of \u03bb-Labelings. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol.\u00a01665, pp. 350\u2013363. Springer, Heidelberg (1999)"},{"key":"8_CR11","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."},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0095-8956(75)90072-6","volume":"19","author":"S.Y. Li","year":"1975","unstructured":"Li, S.Y.: Graphic sequences with unique realization. Journal Comb. Theory, B\u00a019(1), 42\u201368 (1975)","journal-title":"Journal Comb. Theory, B"},{"unstructured":"Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics. Ann. Discrete Math. 56 (1995)","key":"8_CR13"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1137\/S0895480191223178","volume":"7","author":"D. Sakai","year":"1994","unstructured":"Sakai, D.: Labeling Chordal Graphs: Distance Two Condition. SIAM J. Disc. Math.\u00a07, 133\u2013140 (1994)","journal-title":"SIAM J. Disc. Math."}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Algorithms in (Computer) Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19754-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T06:20:06Z","timestamp":1578550806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19754-3_8"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642197536","9783642197543"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19754-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}