35 citations · 100 across the 23 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,…
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…
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…
Firefighting on square, hexagonal, and triangular grids
Tomas Gavenciak, Jan Kratochvil, Pawel Pralat
In this paper, we consider the \emph{firefighter problem} on a graph that is either finite or infinite. Suppose that a fire breaks out at a given vertex . In eac…
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
Vít Jelínek, Eva Jelínková, Jan Kratochvíl +3
It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum n…
Segment representation of a subclass of co-planar graphs
Mathew C. Francis, Jan Kratochvíl, Tomáš Vyskočil
A graph is said to be a segment graph if its vertices can be mapped to line segments in the plane such that two vertices have an edge between them if and only if their correspondin…