Colin Geniet

activity

20202026

most citedSparse graphs with bounded induced cycle packing number have logarithmic treewidth

8 citations · 11 across the 16 of their papers we have counts for

collaborators

Showing 2025Show all

3 papers · 1 filter

cs.DM2025

First-Order Logic and Twin-Width for Some Geometric Graphs

Colin Geniet, Gunwoo Kim, Lucas Meijer

For some geometric graph classes, tractability of testing first-order formulas is precisely characterised by the graph parameter twin-width. This was first proved for interval grap…

math.CO2025

Separability Properties of Monadically Dependent Graph Classes

Édouard Bonnet, Samuel Braunfeld, Ioannis Eleftheriadis +5

A graph class $C$ is monadically dependent if one cannot interpret all graphs in colored graphs from $C$ using a fixed first-order interpretation. We prove that m…

math.CO2025★ 1 cited

$χ$ -Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs

Marthe Bonamy, Colin Geniet

Merge-width, recently introduced by Dreier and Toruńczyk, is a common generalisation of bounded expansion classes and twin-width for which the first-order model checking problem re…

First-Order Logic and Twin-Width for Some Geometric Graphs

Separability Properties of Monadically Dependent Graph Classes

χ-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs

$χ$ -Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs