31 citations · 55 across the 10 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DM2016★ 2 cited
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…
math.CO2016
Fractal property of the graph homomorphism order
Jiří Fiala, Jan Hubička, Yangjing Long +1
We show that every interval in the homomorphism order of finite undirected graphs is either universal or a gap. Together with density and universality this "fractal" property contr…