{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:59:32Z","timestamp":1725728372165},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385353"},{"type":"electronic","value":"9783642385360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_27","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T01:03:04Z","timestamp":1370221384000},"page":"310-321","source":"Crossref","is-referenced-by-count":1,"title":["Dichotomy of the H-Quasi-Cover Problem"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed.","family":"Fiala","sequence":"first","affiliation":[]},{"given":"Marek","family":"Tesa\u0159","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","first-page":"103","volume":"4","author":"J. Abello","year":"1991","unstructured":"Abello, J., Fellows, M.R., Stillwell, J.C.: On the complexity and combinatorics of covering finite complexes. Australian Journal of Combinatorics\u00a04, 103\u2013112 (1991)","journal-title":"Australian Journal of Combinatorics"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-642-20877-5_46","volume-title":"Theory and Applications of Models of Computation","author":"O. B\u00edlka","year":"2011","unstructured":"B\u00edlka, O., Lidick\u00fd, B., Tesa\u0159, M.: Locally injective homomorphism to the simple Weight graphs. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol.\u00a06648, pp. 471\u2013482. Springer, Heidelberg (2011)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0743-7315(89)90048-8","volume":"6","author":"H.L. Bodlaender","year":"1989","unstructured":"Bodlaender, H.L.: The classification of coverings of processor networks. Journal of Parallel Distributed Computing\u00a06, 166\u2013182 (1989)","journal-title":"Journal of Parallel Distributed Computing"},{"key":"27_CR4","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":"27_CR5","doi-asserted-by":"publisher","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":"27_CR6","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.dam.2007.05.051","volume":"156","author":"J. Fiala","year":"2008","unstructured":"Fiala, J., Kratochv\u00edl, J., P\u00f3r, A.: On the computational complexity of partial covers of Theta graphs. Discrete Applied Mathematics\u00a0156, 1143\u20131149 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/11917496_2","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Fiala","year":"2006","unstructured":"Fiala, J., Kratochv\u00edl, J.: Locally injective graph homomorphism: Lists guarantee dichotomy. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 15\u201326. Springer, Heidelberg (2006)"},{"issue":"2","key":"27_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.cosrev.2008.06.001","volume":"2","author":"J. Fiala","year":"2008","unstructured":"Fiala, J., Kratochv\u00edl, J.: Locally constrained graph homomorphisms \u2014 structure, complexity, and applications. Computer Science Review\u00a02(2), 97\u2013111 (2008)","journal-title":"Computer Science Review"},{"issue":"1","key":"27_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2005.09.029","volume":"349","author":"J. Fiala","year":"2005","unstructured":"Fiala, J., Paulusma, D.: A complete complexity classification of the role assignment problem. Theoretical Computer Science\u00a0349(1), 67\u201381 (2005)","journal-title":"Theoretical Computer Science"},{"key":"27_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. Ltd. (1979)"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of H-colouring. Journal of Combinatorial Theory, Series B\u00a048, 92\u2013110 (1990)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"4","key":"27_CR12","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM Journal on Computing\u00a010(4), 718\u2013720 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1996.1743","volume":"71","author":"J. Kratochv\u00edl","year":"1997","unstructured":"Kratochv\u00edl, J., Proskurowski, A., Telle, J.A.: Covering regular graphs. Journal of Combinatorial Theory B\u00a071, 1\u201316 (1997)","journal-title":"Journal of Combinatorial Theory B"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/BFb0024502","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Kratochv\u00edl","year":"1997","unstructured":"Kratochv\u00edl, J., Proskurowski, A., Telle, J.A.: Covering directed multigraphs I. colored directed multigraphs. In: M\u00f6hring, R.H. (ed.) WG 1997. LNCS, vol.\u00a01335, pp. 242\u2013257. Springer, Heidelberg (1997)"},{"key":"27_CR15","first-page":"173","volume":"5","author":"J. Kratochv\u00edl","year":"1998","unstructured":"Kratochv\u00edl, J., Proskurowski, A., Telle, J.A.: Complexity of graph covering problems. Nordic Journal of Computing\u00a05, 173\u2013195 (1998)","journal-title":"Nordic Journal of Computing"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/3-540-40996-3_39","volume-title":"Algorithms and Computation","author":"P. Kristiansen","year":"2000","unstructured":"Kristiansen, P., Telle, J.A.: Generalized H-coloring of graphs. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 456\u2013466. Springer, Heidelberg (2000)"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-19222-7_33","volume-title":"Combinatorial Algorithms","author":"B. Lidick\u00fd","year":"2011","unstructured":"Lidick\u00fd, B., Tesa\u0159, M.: Complexity of Locally Injective Homomorphism to the Theta Graphs. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol.\u00a06460, pp. 326\u2013336. Springer, Heidelberg (2011)"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J., Ne\u0161et\u0159il, J.: Invitation to Discrete Mathematics. Oxford University Press (2008)","DOI":"10.1093\/oso\/9780198570431.001.0001"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38536-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T15:30:56Z","timestamp":1715441456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}