{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T14:04:51Z","timestamp":1768745091161,"version":"3.49.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031066771","type":"print"},{"value":"9783031066788","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06678-8_17","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"228-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["List Covering of\u00a0Regular Multigraphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7973-1361","authenticated-orcid":false,"given":"Jan","family":"Bok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8108-567X","authenticated-orcid":false,"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9518-6386","authenticated-orcid":false,"given":"Nikola","family":"Jedli\u010dkov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2620-6133","authenticated-orcid":false,"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7696-3848","authenticated-orcid":false,"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"17_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. Aust. J. Combin. 4, 103\u2013112 (1991)","journal-title":"Aust. J. Combin."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th ACM Symposium on Theory of Computing, pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"key":"17_CR3","unstructured":"Bard, S., Bellitto, T., Duffy, C., MacGillivray, G., Yang, F.: Complexity of locally-injective homomorphisms to tournaments. Discret. Math. Theor. Comput. Sci. 20(2) (2018). http:\/\/dmtcs.episciences.org\/4999"},{"key":"17_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608704","volume-title":"Algebraic Graph Theory","author":"N Biggs","year":"1974","unstructured":"Biggs, N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1974)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-25870-1_9","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"O B\u00edlka","year":"2011","unstructured":"B\u00edlka, O., Jir\u00e1sek, J., Klav\u00edk, P., Tancer, M., Volec, J.: On the complexity of planar covering of small graphs. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 83\u201394. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25870-1_9"},{"key":"17_CR6","unstructured":"Bok, J., Fiala, J., Hlin\u011bn\u00fd, P., Jedli\u010dkov\u00e1, N., Kratochv\u00edl, J.: Computational complexity of covering multigraphs with semi-edges: small cases. In: Bonchi, F., Puglisi, S.J. (eds.) 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, 23\u201327 August 2021, Tallinn, Estonia. LIPIcs, vol. 202, pp. 21:1\u201321:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2021.21"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-86593-1_6","volume-title":"Fundamentals of Computation Theory","author":"J Bok","year":"2021","unstructured":"Bok, J., Fiala, J., Jedli\u010dkov\u00e1, N., Kratochv\u00edl, J., Seifrtov\u00e1, M.: Computational complexity of covering disconnected multigraphs. In: Bampis, E., Pagourtzis, A. (eds.) FCT 2021. LNCS, vol. 12867, pp. 85\u201399. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86593-1_6"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Chaplick, S., Fiala, J., van\u2019t Hof, P., Paulusma, D., Tesa\u0159, M.: Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Theor. Comput. Sci. 590, 86\u201395 (2015)","DOI":"10.1016\/j.tcs.2015.01.028"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0095-8956(74)90070-7","volume":"16","author":"D\u017d Djokovi\u0107","year":"1974","unstructured":"Djokovi\u0107, D.\u017d: Automorphisms of graphs and coverings. J. Combin. Theory B 16, 243\u2013247 (1974)","journal-title":"J. Combin. Theory B"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1002\/jgt.10088","volume":"43","author":"J Fiala","year":"2003","unstructured":"Fiala, J.: NP completeness of the edge precoloring extension problem on bipartite graphs. J. Graph Theory 43(2), 156\u2013160 (2003)","journal-title":"J. Graph Theory"},{"key":"17_CR11","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. 2223, pp. 537\u2013549. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45678-3_46"},{"key":"17_CR12","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. 4271, pp. 15\u201326. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11917496_2"},{"key":"17_CR13","unstructured":"Fiala, J.: Locally injective homomorphisms. Ph.D. thesis, Charles University, Prague (2000)"},{"issue":"3","key":"17_CR14","first-page":"206","volume":"10","author":"J Fiala","year":"2003","unstructured":"Fiala, J., Heggernes, P., Kristiansen, P., Telle, J.A.: Generalized $$H$$-coloring and $$H$$-covering of trees. Nordic J. Comput. 10(3), 206\u2013224 (2003)","journal-title":"Nordic J. Comput."},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-662-43948-7_41","volume-title":"Automata, Languages, and Programming","author":"J Fiala","year":"2014","unstructured":"Fiala, J., Klav\u00edk, P., Kratochv\u00edl, J., Nedela, R.: Algorithmic aspects of regular graph covers with applications to planar graphs. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 489\u2013501. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_41"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.ejc.2018.06.002","volume":"73","author":"J Fiala","year":"2018","unstructured":"Fiala, J., Klav\u00edk, P., Kratochv\u00edl, J., Nedela, R.: 3-connected reduction for regular graph covers. Eur. J. Comb. 73, 170\u2013210 (2018)","journal-title":"Eur. J. Comb."},{"key":"17_CR17","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. Discuss. Math. Graph Theory 22, 89\u201399 (2002)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"2","key":"17_CR18","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 \u2013 structure, complexity, and applications. Comput. Sci. Rev. 2(2), 97\u2013111 (2008)","journal-title":"Comput. Sci. Rev."},{"issue":"349","key":"17_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2005.09.029","volume":"1","author":"J Fiala","year":"2005","unstructured":"Fiala, J., Paulusma, D.: A complete complexity classification of the role assignment problem. Theoret. Comput. Sci. 1(349), 67\u201381 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR20","unstructured":"Fiala, J., Klav\u00edk, P., Kratochv\u00edl, J., Nedela, R.: Algorithmic aspects of regular graph covers (2016). https:\/\/arxiv.org\/abs\/1609.03013"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0095-8956(74)90072-0","volume":"16","author":"A Gardiner","year":"1974","unstructured":"Gardiner, A.: Antipodal covering graphs. J. Combin. Theory B 16, 255\u2013273 (1974)","journal-title":"J. Combin. Theory B"},{"issue":"1","key":"17_CR22","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1023\/A:1000245600345","volume":"110","author":"E Getzler","year":"1998","unstructured":"Getzler, E., Kapranov, M.M.: Modular operads. Compos. Math. 110(1), 65\u2013125 (1998)","journal-title":"Compos. Math."},{"issue":"4","key":"17_CR23","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. Discret. Math. 5(4), 586\u2013595 (1992). https:\/\/doi.org\/10.1137\/0405048","journal-title":"SIAM J. Discret. Math."},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0012-365X(77)90131-5","volume":"18","author":"JL Gross","year":"1977","unstructured":"Gross, J.L., Tucker, T.W.: Generating all graph coverings by permutation voltage assignments. Discret. Math. 18, 273\u2013283 (1977)","journal-title":"Discret. Math."},{"key":"17_CR25","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.: Complexity of colored graph covers I. Colored directed multigraphs. In: M\u00f6hring, R.H. (ed.) WG 1997. LNCS, vol. 1335, pp. 242\u2013257. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0024502"},{"issue":"1","key":"17_CR26","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. J. Combin. Theory Ser. B 71(1), 1\u201316 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"key":"17_CR27","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 J. Comput. 5, 173\u2013195 (1998)","journal-title":"Nordic J. Comput."},{"key":"17_CR28","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.tcs.2015.09.013","volume":"609","author":"J Kratochv\u00edl","year":"2016","unstructured":"Kratochv\u00edl, J., Telle, J.A., Tesa\u0159, M.: Computational complexity of covering three-vertex multigraphs. Theoret. Comput. Sci. 609, 104\u2013117 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR29","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: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 456\u2013466. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-40996-3_39"},{"key":"17_CR30","first-page":"118","volume":"17","author":"JH Kwak","year":"2007","unstructured":"Kwak, J.H., Nedela, R.: Graphs and their coverings. Lect. Notes Ser. 17, 118 (2007)","journal-title":"Lect. Notes Ser."},{"key":"17_CR31","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0095-8956(82)90042-9","volume":"33","author":"FT Leighton","year":"1982","unstructured":"Leighton, F.T.: Finite common coverings of graphs. J. Combin. Theory B 33, 231\u2013238 (1982)","journal-title":"J. Combin. Theory B"},{"issue":"1","key":"17_CR32","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/B:JACO.0000047294.42633.25","volume":"20","author":"A Malni\u010d","year":"2004","unstructured":"Malni\u010d, A., Maru\u0161i\u010d, D., Poto\u010dnik, P.: Elementary abelian covers of graphs. J. Algebraic Combin. 20(1), 71\u201397 (2004)","journal-title":"J. Algebraic Combin."},{"issue":"7","key":"17_CR33","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1006\/eujc.2000.0390","volume":"21","author":"A Malni\u010d","year":"2000","unstructured":"Malni\u010d, A., Nedela, R., \u0160koviera, M.: Lifting graph automorphisms by voltage assignments. Eur. J. Comb. 21(7), 927\u2013947 (2000)","journal-title":"Eur. J. Comb."},{"key":"17_CR34","unstructured":"Mednykh, A.D., Nedela, R.: Harmonic Morphisms of Graphs: Part I: Graph Coverings. Vydavatelstvo Univerzity Mateja Bela v Banskej Bystrici, 1st edn. (2015)"},{"issue":"2","key":"17_CR35","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1006\/jctb.1996.0044","volume":"67","author":"R Nedela","year":"1996","unstructured":"Nedela, R., \u0160koviera, M.: Regular embeddings of canonical double coverings of graphs. J. Combin. Theory Ser. B 67(2), 249\u2013277 (1996)","journal-title":"J. Combin. Theory Ser. B"},{"key":"17_CR36","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jcss.2019.12.004","volume":"109","author":"K Okrasa","year":"2020","unstructured":"Okrasa, K., Rz\u0105a\u017cewski, P.: Subexponential algorithms for variants of the homomorphism problem in string graphs. J. Comput. Syst. Sci. 109, 126\u2013144 (2020). https:\/\/doi.org\/10.1016\/j.jcss.2019.12.004","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-65759-7","volume-title":"Map Color Theorem","author":"G Ringel","year":"1974","unstructured":"Ringel, G.: Map Color Theorem, vol. 209. Springer, Berlin (1974). https:\/\/doi.org\/10.1007\/978-3-642-65759-7"},{"key":"17_CR38","unstructured":"Shepherd, S., Gardam, G., Woodhouse, D.J.: Two generalisations of Leighton\u2019s theorem (2019). https:\/\/arxiv.org\/abs\/1908.00830"},{"issue":"3","key":"17_CR39","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1017\/S0305004119000550","volume":"170","author":"DJ Woodhouse","year":"2021","unstructured":"Woodhouse, D.J.: Revisiting Leighton\u2019s theorem with the Haar measure. Math. Proc. Camb. Philos. Soc. 170(3), 615\u2013623 (2021). https:\/\/doi.org\/10.1017\/S0305004119000550","journal-title":"Math. Proc. Camb. Philos. Soc."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06678-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:06:48Z","timestamp":1653779208000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}