10 citations · 26 across the 5 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2022★ 1 cited
Transducing paths in graph classes with unbounded shrubdepth
Michał Pilipczuk, Patrice Ossona de Mendez, Sebastian Siebertz
Transductions are a general formalism for expressing transformations of graphs (and more generally, of relational structures) in logic. We prove that a graph class ca…
math.CO2019★ 2 cited
Jones' Conjecture in subcubic graphs
Marthe Bonamy, François Dross, Tomáš Masařík +3
We confirm Jones' Conjecture for subcubic graphs. Namely, if a subcubic planar graph does not contain vertex-disjoint cycles, then it suffices to delete vertices to obta…