35 citations · 100 across the 23 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DM2015★ 3 cited
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…
math.CO2015
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…