research
∙
09/12/2023
The χ-binding function of d-directional segment graphs
Given a positive integer d, the class d-DIR is defined as all those inte...
share
research
∙
07/06/2023
The grid-minor theorem revisited
We prove that for every planar graph X of treedepth h, there exists a po...
research
∙
02/08/2022
Computer assisted discharging procedure on planar graphs: application to 2-distance coloring
Using computational techniques we provide a framework for proving result...
research
∙
11/29/2021
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth
We study the minimum size f of a feedback vertex set in directed and und...
research
∙
09/29/2021
2-distance list (Δ+2)-coloring of planar graphs with girth at least 10
Given a graph G and a list assignment L(v) for each vertex of v of G. A ...
research
∙
09/24/2021
2-distance (Δ+2)-coloring of sparse graphs
A 2-distance k-coloring of a graph is a proper k-coloring of the vertice...
research
∙
06/07/2021
2-distance 4-coloring of planar subcubic graphs with girth at least 21
A 2-distance k-coloring of a graph is a proper vertex k-coloring where v...
research
∙
05/04/2021
2-distance list (Δ+ 3)-coloring of sparse graphs
A 2-distance list k-coloring of a graph is a proper coloring of the vert...
research
∙
03/22/2021
2-distance (Δ+1)-coloring of sparse graphs using the potential method
A 2-distance k-coloring of a graph is a proper k-coloring of the vertice...
research
∙
08/08/2020