{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T11:52:55Z","timestamp":1768737175494,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662439470","type":"print"},{"value":"9783662439487","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_41","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"489-501","source":"Crossref","is-referenced-by-count":4,"title":["Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"first","affiliation":[]},{"given":"Pavel","family":"Klav\u00edk","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]},{"given":"Roman","family":"Nedela","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: ACM Symposium on Theory of Computing, pp. 82\u201393. ACM (1980)","DOI":"10.1145\/800141.804655"},{"key":"#cr-split#-41_CR2.1","unstructured":"Babai, L.: Automorphism groups of planar graphs II. In: Infinite and finite sets, pp. 29-84. North-Holland, Bolyai (1975)"},{"key":"#cr-split#-41_CR2.2","unstructured":"Proc. Conf. Keszthely, Hungary (1973)"},{"key":"41_CR3","unstructured":"Babai, L.: Automorphism groups, isomorphism, reconstruction. In: Handbook of combinatorics, vol.\u00a02, pp. 1447\u20131540. MIT Press (1996)"},{"key":"41_CR4","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.\u00a06986, pp. 83\u201394. Springer, Heidelberg (2011)"},{"issue":"1","key":"41_CR5","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 and Distributed Computing\u00a06(1), 166\u2013182 (1989)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"174","DOI":"10.2307\/2369306","volume":"1","author":"A. Cayley","year":"1878","unstructured":"Cayley, A.: The theory of groups: Graphical representation. Amer. J. Math.\u00a01, 174\u2013176 (1878)","journal-title":"Amer. J. Math."},{"issue":"1","key":"41_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1002\/net.3230100109","volume":"10","author":"P. Erd\u00f6s","year":"1980","unstructured":"Erd\u00f6s, P., Fajtlowicz, S., Hoffman, A.J.: Maximum degree in graphs of diameter 2. Networks\u00a010(1), 87\u201390 (1980)","journal-title":"Networks"},{"issue":"6","key":"41_CR8","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1090\/S1061-0022-04-00833-7","volume":"15","author":"S. Evdokimov","year":"2004","unstructured":"Evdokimov, S., Ponomarenko, I.: Circulant graphs: recognizing and isomorphism testing in polynomial time. St. Petersburg Mathematical Journal\u00a015(6), 813\u2013835 (2004)","journal-title":"St. Petersburg Mathematical Journal"},{"key":"41_CR9","first-page":"103","volume":"4","author":"M.R. Fellows","year":"1991","unstructured":"Fellows, M.R., Stillweil, J.C.: On the complexity and combinatorics of covering finite complexes. Australasian Journal of Combinatorics\u00a04, 103\u2013112 (1991)","journal-title":"Australasian Journal of Combinatorics"},{"key":"41_CR10","unstructured":"Fiala, J.: Note on the computational complexity of covering regular graphs. In: 9th Annual Conference of Doctoral Students, WDS 2000, pp. 89\u201390. Matfyzpress (2000)"},{"issue":"5","key":"41_CR11","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1147\/rd.45.0497","volume":"4","author":"A.J. Hoffman","year":"1960","unstructured":"Hoffman, A.J., Singleton, R.R.: On moore graphs with diameters 2 and 3. IBM Journal of Research and Development\u00a04(5), 497\u2013504 (1960)","journal-title":"IBM Journal of Research and Development"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Isomorphism of planar graphs. In: Complexity of computer computations, pp. 131\u2013152. Springer (1972)","DOI":"10.1007\/978-1-4684-2001-2_13"},{"issue":"3","key":"41_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM Journal on Computing\u00a02(3), 135\u2013158 (1973)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"41_CR14","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. Comb. Theory Ser. B\u00a071(1), 1\u201316 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"41_CR15","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1137\/0210002","volume":"10","author":"A. Lubiw","year":"1981","unstructured":"Lubiw, A.: Some NP-complete problems similar to graph isomorphism. SIAM Journal on Computing\u00a010(1), 11\u201321 (1981)","journal-title":"SIAM Journal on Computing"},{"issue":"7","key":"41_CR16","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. European Journal of Combinatorics\u00a021(7), 927\u2013947 (2000)","journal-title":"European Journal of Combinatorics"},{"issue":"1","key":"41_CR17","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1006\/jctb.1998.1828","volume":"74","author":"B.D. McKay","year":"1998","unstructured":"McKay, B.D., Miller, M., \u0160ir\u00e1\u0148, J.: A note on large graphs of diameter two and given maximum degree. J. Combin. Theory Ser. B\u00a074(1), 110\u2013118 (1998)","journal-title":"J. Combin. Theory Ser. B"},{"key":"41_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1888","volume":"61","author":"M. Miller","year":"2005","unstructured":"Miller, M., \u0160ir\u00e1\u0148, J.: Moore graphs and beyond: A survey of the degree\/diameter problem. Electronic Journal of Combinatorics\u00a061, 1\u201363 (2005)","journal-title":"Electronic Journal of Combinatorics"},{"issue":"2","key":"41_CR19","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0012-365X(88)90090-8","volume":"70","author":"S. Negami","year":"1988","unstructured":"Negami, S.: The spherical genus and virtually planar graphs. Discrete Mathematics\u00a070(2), 159\u2013168 (1988)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"41_CR20","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1137\/06067434X","volume":"23","author":"S. Zhou","year":"2009","unstructured":"Zhou, S.: A class of arc-transitive Cayley graphs as models for interconnection networks. SIAM Journal on Discrete Mathematics\u00a023(2), 694\u2013714 (2009)","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T18:11:20Z","timestamp":1597947080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}