3 citations · 4 across the 6 of their papers we have counts for
Showing 2026 · cs.DMShow all
2 papers · 2 filters
cs.DM2026
Monadically Dependent Graph Classes Have Almost Bounded Merge-Width
Jan Dreier, Nikolas Mählmann, Michał Pilipczuk +1
A graph class is monadically dependent if one cannot interpret all graphs in vertex-colored graphs from using a fixed formula of first-order logic. We p…
cs.DM2026
Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes
Jan Dreier, Nikolas Mählmann, Rose McCarty +2
Monadic dependence is a proposed structural dividing line for fixed-parameter tractability of first-order model checking on hereditary graph classes. A graph class is \emph{monadic…