Showing cs.DMShow all
2 papers · 1 filter
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
Partitioning a graph into degenerate subgraphs
Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes
Let be a connected graph with maximum degree distinct from . Given integers and , is said to be $(p_1, \dots, p…