3 citations · 8 across the 25 of their papers we have counts for
4 papers · 1 filter
Improved exploration of temporal graphs
Paul Bastide, Carla Groenland, Lukas Michel +2
A temporal graph is a sequence of graphs on the same vertex set of size . The \emph{temporal exploration problem} asks for the length of the shortest seque…
Making an oriented graph acyclic using inversions of bounded or prescribed size
Jørgen Bang-Jensen, Frédéric Havet, Florian Hörsch +3
Given an oriented graph , the inversion of a subset of vertices consists in reversing the orientation of all arcs with both endpoints in . When the subset is of size…
Faithful universal graphs for minor-closed classes
Paul Bastide, Louis Esperet, Carla Groenland +3
It was proved by Huynh, Mohar, Šámal, Thomassen and Wood in 2021 that any countable graph containing every countable planar graph as a subgraph has an infinite clique minor. We pro…
Excluding a rectangular grid
Clément Rambaud
For every positive integer , we define the -treedepth as the largest graph parameter satisfying (i) ; (ii) $\mathrm{td}_k(G) \leq…