activity
20222026
most citedFirst-Order Model Checking on Structurally Sparse Graph Classes

2 citations · 3 across the 6 of their papers we have counts for

collaborators
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…

cs.LO2023★ 2 cited

First-Order Model Checking on Structurally Sparse Graph Classes

Jan Dreier, Nikolas Mählmann, Sebastian Siebertz

A class of graphs is structurally nowhere dense if it can be constructed from a nowhere dense class by a first-order transduction. Structurally nowhere dense classes vastly general…