research
∙
06/03/2023
Subchromatic numbers of powers of graphs with excluded minors
A k-subcolouring of a graph G is a function f:V(G) →{0,…,k-1} such that ...
share
research
∙
01/27/2023
Decompositions into two linear forests of bounded lengths
For some k ∈ℤ_≥ 0∪∞, we call a linear forest k-bounded if each of its co...
research
∙
05/25/2022
Square roots of nearly planar graphs
We prove that it is NP-hard to decide whether a graph is the square of a...
research
∙
03/13/2022
Local Hadwiger's Conjecture
We propose local versions of Hadwiger's Conjecture, where only balls of ...
research
∙
04/24/2018
Reconfiguration of graph minors
Under the reconfiguration framework, we consider the various ways that a...
research
∙
03/16/2018
Reconfiguring spanning and induced subgraphs
Subgraph reconfiguration is a family of problems focusing on the reachab...
research
∙
12/01/2017
