{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T05:05:29Z","timestamp":1754111129876},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291060"},{"type":"electronic","value":"9783540320241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560586_19","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:08:27Z","timestamp":1129817307000},"page":"228-236","source":"Crossref","is-referenced-by-count":3,"title":["On the Computational Complexity of the L (2,1)-Labeling Problem for Regular Graphs"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"first","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Calamoneri, T.: The L(h,k)-labeling probelm: a survey. Tech. Rep. 04\/2004, Dept. of Comp. Sci, Univ, of Rome - \u201dLa Sapienza\u201d (2004)"},{"key":"19_CR2","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":"19_CR3","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":"19_CR4","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)"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1137\/S0895480101391247","volume":"17","author":"J.P. Georges","year":"2003","unstructured":"Georges, J.P., Mauro, D.W.: On regular graphs optimally labeled with a condition at distance two. SIAM Journal of Discrete Mathematics\u00a017(2), 320\u2013331 (2003)","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"4","key":"19_CR6","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":"12","key":"19_CR7","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. of the IEEE\u00a068(12), 1497\u20131514 (1980)","journal-title":"Proc. of the IEEE"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1137\/S0895480103424079","volume":"18","author":"D. Kr\u00e1l","year":"2004","unstructured":"Kr\u00e1l, D.: Coloring powers of chordal graphs. SIAM J. Discrete Math.\u00a018(3), 451\u2013461 (2004)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1137\/S0895480101399449","volume":"16","author":"D. Kr\u00e1l","year":"2003","unstructured":"Kr\u00e1l, D., \u0160krekovski, R.: A theorem about the channel assignment problem. SIAM J. Discrete Math.\u00a016(3), 426\u2013437 (2003)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1996.1743","volume":"B 71","author":"J. Kratochv\u00edl","year":"1997","unstructured":"Kratochv\u00edl, J., Proskurowski, A., Telle, J.A.: Covering regular graphs. Journal of Combinatorial Theory\u00a0B 71(1), 1\u201316 (1997)","journal-title":"Journal of Combinatorial Theory"},{"issue":"1","key":"19_CR11","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 Journal of Discrete Mathematics\u00a07(1), 133\u2013140 (1994)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"19_CR12","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)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560586_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:13:16Z","timestamp":1619507596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560586_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291060","9783540320241"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11560586_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}