3 citations · 4 across the 6 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.LO2023
First-Order Model Checking on Monadically Stable Graph Classes
Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann +3
A graph class is called monadically stable if one cannot interpret, in first-order logic, arbitrary large linear orders in colored graphs from . We prove…
math.CO2023★ 3 cited
Flip-width: Cops and Robber on dense graphs
Szymon Toruńczyk
We define new graph parameters, called flip-width, that generalize treewidth, degeneracy, and generalized coloring numbers for sparse graphs, and clique-width and twin-width for de…