{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T23:47:44Z","timestamp":1738194464228,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_11","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"125-135","source":"Crossref","is-referenced-by-count":2,"title":["Distance Constrained Labelings of Trees"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr A.","family":"Golovach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"11_CR1","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)-labeling problem: A survey and annotated bibliography. Computer Journal\u00a049(5), 585\u2013608 (2006)","journal-title":"Computer Journal"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0012-365X(99)00400-8","volume":"3","author":"G.J. Chang","year":"2000","unstructured":"Chang, G.J., Ke, W.-T., Liu, D.D.-F., Yeh, R.K.: On l(d,1)-labellings of graphs. Discrete Mathematics\u00a03(1), 57\u201366 (2000)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"11_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"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs. Inf. Comput.\u00a085(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/11523468_30","volume-title":"Automata, Languages and Programming","author":"J. Fiala","year":"2005","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Distance Constrained Labelings of Graphs of Bounded Treewidth. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 360\u2013372. Springer, Heidelberg (2005)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (1999)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-45678-3_46","volume-title":"Algorithms and Computation","author":"J. Fiala","year":"2001","unstructured":"Fiala, J., Kratochv\u00edl, J.: Complexity of Partial Covers of Graphs. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 537\u2013549. Springer, Heidelberg (2001)"},{"key":"11_CR8","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"},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0166-218X(00)00387-5","volume":"113","author":"J. Fiala","year":"2001","unstructured":"Fiala, J., Kratochv\u00edl, J., Kloks, T.: Fixed-parameter complexity of \u03bb-labelings. Discrete Applied Mathematics\u00a0113(1), 59\u201372 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.endm.2005.05.012","volume":"19","author":"J. Fiala","year":"2005","unstructured":"Fiala, J., Kratochv\u00edl, J., P\u00f3r, A.: On the computational complexity of partial covers of theta graphs. Electronic Notes in Discrete Mathematics\u00a019, 79\u201385 (2005)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"11_CR11","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)"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.dam.2004.02.018","volume":"145","author":"J. Fiala","year":"2005","unstructured":"Fiala, J., Kratochv\u00edl, J., Proskurowski, A.: Systems of distant representatives. Discrete Applied Mathematics\u00a0145(2), 306\u2013316 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR13","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Co., New York (1979)"},{"key":"11_CR14","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 (in Russian). Zap. nau. sem. POMI\u00a0293, 5\u201325 (2002)","journal-title":"Zap. nau. sem. POMI"},{"issue":"4","key":"11_CR15","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"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Harary, F.: Graph theory. Addison-Wesley Series in Mathematics IX (1969)","DOI":"10.21236\/AD0705364"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Leese, R.A.: A fresh look at channel assignment in uniform networks. In: EMC 1997 Symposium, Zurich, pp. 127\u2013130 (1997)","DOI":"10.23919\/EMC.1997.10785250"},{"key":"11_CR18","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)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Leese, R.A., Noble, S.D.: Cyclic labellings with constraints at two distances. Electr. J. Comb.\u00a011(1) (2004)","DOI":"10.37236\/1769"},{"key":"11_CR20","first-page":"177","volume":"69","author":"D.D.-F. Liu","year":"2003","unstructured":"Liu, D.D.-F., Zhu, X.: Circulant distant two labeling and circular chromatic number. Ars Combinatoria\u00a069, 177\u2013183 (2003)","journal-title":"Ars Combinatoria"},{"key":"11_CR21","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502081.001.0001","volume-title":"Invitation to Discrete Mathematics","author":"J. Matou\u0161ek","year":"1998","unstructured":"Matou\u0161ek, J., Ne\u0161et\u0159il, J.: Invitation to Discrete Mathematics. Oxford University Press, Oxford (1998)"},{"key":"11_CR22","series-title":"CMS Books Math.\/Ouvrages Math. SMC","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/0-387-22444-0_2","volume-title":"Recent advances in algorithms and combinatorics","author":"C. McDiarmid","year":"2003","unstructured":"McDiarmid, C.: Discrete mathematics and radio channel assignment. In: Recent advances in algorithms and combinatorics. CMS Books Math.\/Ouvrages Math. SMC, vol.\u00a011, pp. 27\u201363. Springer, Heidelberg (2003)"},{"issue":"12","key":"11_CR23","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. Discrete Mathematics\u00a0306(12), 1217\u20131231 (2006)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T23:02:37Z","timestamp":1738191757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_11","relation":{},"subject":[]}}