35 citations · 100 across the 23 of their papers we have counts for
4 papers · 1 filter
Algorithmic Aspects of 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 covers where this homomorphism is prescribed by the action of…
Simultaneous Orthogonal Planarity
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen +7
We introduce and study the problem: Given planar graphs each with maximum degree 4 and the same vertex set, do they admit an OrthoSEFE, that is, is there…
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,…
On the hardness of switching to a small number of edges
Vít Jelínek, Eva Jelínková, Jan Kratochvíl
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unc…