Let k ≥ 1. A graph G is 𝐖_𝐤 if for any k pairwise
disjoint independent v...
The (Perfect) Matching Cut is to decide if a graph has a (perfect) match...
A subset I of the vertex set V(G) of a graph G is called a k-clique
inde...
Let G be a connected graph with maximum degree Δ≥ 3 distinct
from K_Δ + ...
In the 70s, Berge introduced 1-extendable graphs (also called B-graphs),...
For an integer k ≥ 1 and a graph G, let 𝒦_k(G) be the
graph that has ver...
A matching-cut of a graph is an edge cut that is a matching. The problem...
The reconfiguration graph for the k-colourings of a graph G, denoted
R_k...
A set of sets is called a family. Two families 𝒜 and
ℬ of sets are said ...
A graph is H-free if it contains no induced subgraph isomorphic to H. We...
The reconfiguration graph R_k(G) of the k-colourings of a graph G has
as...
The reconfiguration graph R_k(G) of the k-colourings of a graph G
contai...
Let k ≥ 1 be an integer. The reconfiguration graph R_k(G) of the
k-colou...
The reconfiguration graph R_k(G) of the k-colourings of a graph G has
as...
Let G = (V, E) be a graph with maximum degree k≥ 3 distinct from
K_k+1. ...
The reconfiguration graph R_k(G) of the k-colourings of a graph G has
as...
Let G be a simple undirected graph on n vertices with maximum
degree Δ. ...