Showing 2018 · cs.DMShow all
2 papers · 2 filters
cs.DM2018
Towards Cereceda's conjecture for planar graphs
Eduard Eiben, Carl Feghali
The reconfiguration graph of the -colourings of a graph has as vertex set the set of all possible -colourings of and two colourings are adjacent if they diff…
cs.DM2018
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
Eduard Eiben, Dušan Knop, Fahad Panolan +1
In the Directed Steiner Network problem we are given an arc-weighted digraph , a set of terminals , and an (unweighted) directed request graph with $V(R)=T…