31 citations · 55 across the 10 of their papers we have counts for
6 papers · 1 filter
Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs
Carl Feghali, Jiří Fiala
The reconfiguration graph of the -colourings of a graph contains as its vertex set the -colourings of and two colourings are joined by an edge if they differ…
Gaps in full homomorphism order
Jiří Fiala, Jan Hubička, Yangjing Long
We characterise gaps in the full homomorphism order of graphs.
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…
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…
Universality of intervals of line graph order
Jiří Fiala, Jan Hubička, Yangjing Long
We prove that for every the homomorphism order of the class of line graphs of finite graphs with maximal degree is universal. This means that every finite or countabl…