Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs

  title={Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs},
  author={Jir{\'i} Fiala and Pavel Klav{\'i}k and Jan Kratochv{\'i}l and Roman Nedela},
A graph G covers a graphH if there exists a locally bijective homomorphism from G to H. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of Aut(G). Regular covers have many applications in constructions and studies of big objects all over mathematics and computer science. We study computational aspects of regular covers that have not been addressed before. The decision problem RegularCover asks for two given graphs G and H whether… CONTINUE READING
This paper has been referenced on Twitter 3 times. VIEW TWEETS


Publications referenced by this paper.

Automorphism groups, isomorphism, reconstruction

  • L. Babai
  • Handbook of combinatorics (vol. 2), pages 1447…
  • 1996
Highly Influential
7 Excerpts

On the complexity of planar covering of small graphs

  • O. B́ılka, J. Jirásek, P. Klav́ık, M. Tancer, J. Volec
  • In LNCS, WG,
  • 2011
1 Excerpt

A class of arc-transitive Cayley graphs as models for interconnection networks

  • S. Zhou
  • SIAM Journal on Discrete Mathematics, 23(2):694…
  • 2009
1 Excerpt

Similar Papers

Loading similar papers…