31 citations · 55 across the 10 of their papers we have counts for
5 papers · 1 filter
List covering of regular multigraphs with semi-edges
Jan Bok, Jiří Fiala, Nikola Jedličková +2
In line with the recent development in topological graph theory, we are considering undirected graphs that are allowed to contain {\em multiple edges}, {\em loops}, and {\em semi-e…
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…
Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems
Jiří Fiala, Tomáš Gavenčiak, Dušan Knop +2
We study computational complexity of the class of distance-constrained graph labeling problems from the fixed parameter tractability point of view. The parameters studied are neigh…
The packing chromatic number of the square lattice is at least 12
Jan Ekstein, Jiří Fiala, Přemysl Holub +1
The packing chromatic number of a graph is the smallest integer such that the vertex set can be partitioned into disjoint classes , where ver…
The k-in-a-path problem for claw-free graphs
Jiri Fiala, Marcin Kaminski, Bernard Lidicky +1
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k=3. We show how to solve this problem in polynomial tim…