We consider spanning trees of n points in convex position whose edges ar...
We show that every 3-connected K_2,ℓ-minor free graph with minimum
degre...
The independent set reconfiguration problem asks whether one can transfo...
A coloring of a digraph is a partition of its vertex set such that each ...
The discharging method is a powerful proof technique, especially for gra...
Local certification consists in assigning labels (called certificates)
t...
For an integer k ≥ 1 and a graph G, let 𝒦_k(G) be the
graph that has ver...
Can every connected graph burn in ⌈√(n)⌉ steps? While this
conjecture re...
The graph model checking problem consists in testing whether an input gr...
Local certification consists in assigning labels to the nodes of a netwo...
In a (parameterized) graph edge modification problem, we are given a gra...
A signed graph (G, σ) is a graph G along with a function σ:
E(G) →{+,-}....
Coloring a graph G consists in finding an assignment of colors c:
V(G)→{...
Pushable homomorphisms and the pushable chromatic number χ_p of oriented...
We study the complexity of graph modification problems for homomorphism-...
We study homomorphism problems of signed graphs. A signed graph is an
un...
Total coloring is a variant of edge coloring where both vertices and edg...