412 citations · 423 across the 12 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
Twin-width and generalized coloring numbers
Jan Dreier, Jakub Gajarsky, Yiting Jiang +2
In this paper, we prove that a graph with no -subgraph and twin-width has -admissibility and -coloring numbers bounded from above by an exponential function…
cs.DM2021★ 3 cited
Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
Jan Dreier
The concept of bounded expansion provides a robust way to capture sparse graph classes with interesting algorithmic properties. Most notably, every problem definable in first-order…