
Local certification of MSO properties for bounded treedepth graphs
The graph model checking problem consists in testing whether an input gr...
read it

Local certification of graph decompositions and applications to minorfree classes
Local certification consists in assigning labels to the nodes of a netwo...
read it

(Sub)linear kernels for edge modification problems towards structured graph classes
In a (parameterized) graph edge modification problem, we are given a gra...
read it

On the signed chromatic number of some classes of graphs
A signed graph (G, σ) is a graph G along with a function σ: E(G) →{+,}....
read it

A Brookslike result for graph powers
Coloring a graph G consists in finding an assignment of colors c: V(G)→{...
read it

Pushable chromatic number of graphs with degree constraints
Pushable homomorphisms and the pushable chromatic number χ_p of oriented...
read it

Parameterized complexity of edgecoloured and signed graph homomorphism problems
We study the complexity of graph modification problems for homomorphism...
read it

Complexity of planar signed graph homomorphisms to cycles
We study homomorphism problems of signed graphs. A signed graph is an un...
read it

Every planar graph with Δ≥ 8 is totally (Δ+2)choosable
Total coloring is a variant of edge coloring where both vertices and edg...
read it
Théo Pierron
is this you? claim profile