
Mixing colourings in 2K_2free graphs
The reconfiguration graph for the kcolourings of a graph G, denoted R_k...
read it

The maximum sum of sizes of crossintersecting families of subsets of a set
A set of sets is called a family. Two families 𝒜 and ℬ of sets are said ...
read it

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
A graph is Hfree if it contains no induced subgraph isomorphic to H. We...
read it

Reconfiguring colourings of graphs with bounded maximum average degree
The reconfiguration graph R_k(G) of the kcolourings of a graph G has as...
read it

Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs
The reconfiguration graph R_k(G) of the kcolourings of a graph G contai...
read it

Reconfiguring 10colourings of planar graphs
Let k ≥ 1 be an integer. The reconfiguration graph R_k(G) of the kcolou...
read it

Towards Cereceda's conjecture for planar graphs
The reconfiguration graph R_k(G) of the kcolourings of a graph G has as...
read it

Partitioning a graph into degenerate subgraphs
Let G = (V, E) be a graph with maximum degree k≥ 3 distinct from K_k+1. ...
read it

Paths between colourings of sparse graphs
The reconfiguration graph R_k(G) of the kcolourings of a graph G has as...
read it

A Reconfigurations Analogue of Brooks' Theorem and its Consequences
Let G be a simple undirected graph on n vertices with maximum degree Δ. ...
read it
Carl Feghali
is this you? claim profile