{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:24Z","timestamp":1725558984225},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_5","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:01:42Z","timestamp":1278097302000},"page":"58-67","source":"Crossref","is-referenced-by-count":2,"title":["Elegant Distance Constrained Labelings of Trees"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"first","affiliation":[]},{"given":"Petr A.","family":"Golovach","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for treedecomposable graphs. J. Algorithms\u00a012(2), 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"key":"5_CR2","first-page":"222","volume-title":"International Parallel and Distributed Processing Symposium, 17th IPDPS 2003, Nice","author":"A.A. Bertossi","year":"2003","unstructured":"Bertossi, A.A., Pinotti, M.C., Rizzi, R.: Channel assignment on stronglysimplicial graphs. In: International Parallel and Distributed Processing Symposium, 17th IPDPS 2003, Nice, p. 222. IEEE Computer Society Press, Los Alamitos (2003)"},{"issue":"2","key":"5_CR3","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 Journal of Discrete Mathematics\u00a09(2), 309\u2013316 (1996)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"1","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput. 85"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.7151\/dmgt.1159","volume":"22","author":"J. Fiala","year":"2002","unstructured":"Fiala, J., Kratochv\u00edl, J.: Partial covers of graphs. Discussiones Mathematicae Graph Theory\u00a022, 89\u201399 (2002)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/3-540-45446-2_18","volume-title":"Theoretical Computer Science","author":"J. Fiala","year":"2001","unstructured":"Fiala, J., Kratochv\u00edl, J., Proskurowski, A.: Distance constrained labeling of precolored trees. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol.\u00a02202, pp. 285\u2013292. Springer, Heidelberg (2001)"},{"key":"5_CR7","first-page":"5","volume":"293","author":"P.A. Golovach","year":"2002","unstructured":"Golovach, P.A.: Systems of pair of q-distant representatives and graph colorings. Zap. nau. sem. POMI\u00a0293, 5\u201325 (2002) (in Russian)","journal-title":"Zap. nau. sem. POMI"},{"issue":"4","key":"5_CR8","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 Journal of Discrete Mathematics\u00a05(4), 586\u2013595 (1992)","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/jagm.1998.9999","volume":"29","author":"P.E. Kearney","year":"1998","unstructured":"Kearney, P.E., Corneil, D.G.: Tree powers. Journal of Algorithms\u00a029(1), 111\u2013131 (1998)","journal-title":"Journal of Algorithms"},{"key":"5_CR10","unstructured":"Kohl, A., Schreyer, J., Tuza, Z., Voigt, M.: Choosability problems for (d, s)-colorings (2003) (in preparation)"},{"key":"5_CR11","unstructured":"Leese, R.A.: Radio spectrum: a raw material for the telecommunications industry. In: 10th Conference of the European Consortium for Mathematics in Industry, Goteborg (1998)"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/S089548019120016X","volume":"8","author":"Y.L. Lin","year":"1995","unstructured":"Lin, Y.L., Skiena, S.S.: Algorithms for square roots of graphs. SIAM Journal on Discrete Mathematics\u00a08(1), 99\u2013118 (1995)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/800133.804350","volume-title":"Proceedings of the 10th Annual ACM Symposium on Theory of Computing","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: The complexity of the satisfability problem. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216\u2013226. ACM, New York (1978)"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<263::AID-JGT5>3.0.CO;2-V","volume":"29","author":"J. Heuvel van den","year":"1998","unstructured":"van den Heuvel, J., Leese, R.A., Shepherd, M.A.: Graph labeling and radio channel assignment. Journal of Graph Theory\u00a029(4), 263\u2013283 (1998)","journal-title":"Journal of Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30559-0_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:30:03Z","timestamp":1620012603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}