19 citations · 63 across the 12 of their papers we have counts for
7 papers · 1 filter
Cops and Robbers on Intersection Graphs
Tomáš Gavenčiak, Przemysław Gordinowicz, Vít Jelínek +2
The cop number of a graph is the smallest such that cops win the game of cops and robber on . We investigate the maximum cop number of geometric intersection graphs,…
Jordan-like characterization of automorphism groups of planar graphs
Pavel Klavík, Roman Nedela, Peter Zeman
We investigate automorphism groups of planar graphs. The main result is a complete recursive description of all abstract groups that can be realized as automorphism groups of plana…
3-connected Reduction for Regular Graph Covers
Jiří Fiala, Pavel Klavík, Jan Kratochvíl +1
A graph covers a graph if there exists a locally bijective homomorphism from to . We deal with regular coverings in which this homomorphism is prescribed by an actio…
Automorphism Groups of Geometrically Represented Graphs
Pavel Klavík, Peter Zeman
We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representati…
Minimal Obstructions for Partial Representations of Interval Graphs
Pavel Klavík, Maria Saumell
Interval graphs are intersection graphs of closed intervals. A generalization of recognition called partial representation extension was introduced recently. The input gives an int…
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs
Jiří Fiala, Pavel Klavík, Jan Kratochvíl +1
A graph covers a graph if there exists a locally bijective homomorphism from to . We deal with regular covers in which this locally bijective homomorphism is prescri…
On the Complexity of Planar Covering of Small Graphs
Ondřej Bílka, Jozef Jirásek, Pavel Klavík +2
The problem Cover(H) asks whether an input graph G covers a fixed graph H (i.e., whether there exists a homomorphism G to H which locally preserves the structure of the graphs). Co…