For each d≤3, we construct a finite set F_d of multigraphs such that
for...
We investigate the twin-width of the Erdős-Rényi random graph G(n,p).
We...
A proper coloring of a graph is proper conflict-free if every
non-isolat...
Let ℱ be a family of graphs, and let p,r be nonnegative
integers. The (p...
Bonnet, Kim, Thomassé, and Watrigant (2020) introduced the twin-width of...
For a family of graphs ℱ, Weighted ℱ-Deletion is the
problem for which t...
We introduce a new subclass of chordal graphs that generalizes split gra...
A graph G is an ℓ-leaf power of a tree T if V(G) is equal to the
set of ...