{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:36:44Z","timestamp":1725482204782},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667315"},{"type":"electronic","value":"9783540467847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_33","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T12:02:55Z","timestamp":1175774575000},"page":"350-363","source":"Crossref","is-referenced-by-count":19,"title":["Fixed-Parameter Complexity of \u03bb-Labelings"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"first","affiliation":[]},{"given":"Ton","family":"Kloks","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","first-page":"103","volume":"4","author":"J. Abello","year":"1991","unstructured":"Abello J., M.R. Fellows and J.C. Stillwell, On the complexity and combinatorics of covering finite complexes, Australasian Journal of Combinatorics\n                        4 (1991), 103\u2013112 351","journal-title":"Australasian Journal of Combinatorics"},{"key":"33_CR2","unstructured":"Brandst\u00e4dt, Andreas, Special graph classes-A survey, Schriftenreihe des Fachsbereichs Mathematik, SM-DU-199 (1991), Universit\u00e4t Duisburg Gesamthochschule. 352"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"G. J. Chang","year":"1996","unstructured":"Chang, G. J. and D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Disc. Math.\n                        9, (1996), pp. 309\u2013316. 352, 353","journal-title":"SIAM J. Disc. Math."},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J. R. Griggs","year":"1992","unstructured":"Griggs, J. R. and R. K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Disc. Math.\n                        5, (1992), pp. 586\u2013595. 350, 353, 356","journal-title":"SIAM J. Disc. Math."},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(94)90026-4","volume":"133","author":"J. Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, Jan, Regular codes in regular graphs are difficult, Discrete Math.\n                        133 (1994), 191\u2013205 351","journal-title":"Discrete Math."},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1996.1743","volume":"71","author":"J. Kratochv\u00edl","year":"1997","unstructured":"Kratochv\u00edl, Jan, Andrzej Proskurowski, and Jan Arne Telle, Covering regular graphs Journal of Combin. Theory Ser. B 71 (1997), 1\u201316 351","journal-title":"Journal of Combin. Theory Ser. B"},{"key":"33_CR7","unstructured":"Kratochv\u00edl, Jan, Andrzej Proskurowski, and Jan Arne Telle, Covering directed multigraphs I. Colored directed multigraphs, In: Graph-Theoretical Concepts in Computer Science, Proceedings 23rd WG\u2019 97, Berlin, Lecture Notes in Computer Science 1335, Springer Verlag, (1997), pp. 242\u2013257. 351, 352"},{"key":"33_CR8","first-page":"173","volume":"5","author":"J. Kratochv\u00edl","year":"1998","unstructured":"Kratochv\u00edl, Jan, Andrzej Proskurowski, and Jan Arne Telle, Complexity of graph covering problems Nordic Journal of Computing\n                        5 (1998), 173\u2013195 351","journal-title":"Nordic Journal of Computing"},{"key":"33_CR9","first-page":"13","volume":"47","author":"D. D.-F. Liu","year":"1997","unstructured":"Liu, D. D.-F. and R. K. Yeh, On distance two labellings of graphs, ARS Combinatorica\n                        47, (1997), pp. 13\u201322. 351","journal-title":"ARS Combinatorica"},{"key":"33_CR10","unstructured":"Yeh, Kwan-Ching, Labeling graphs with a condition at distance two, Ph.D. Thesis, University of South Carolina, 1990. 350, 351"}],"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\/3-540-46784-X_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T07:36:00Z","timestamp":1550302560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}