On classes of bounded tree rank, their interpretations, and efficient
sparsification
On classes of bounded tree rank, their interpretations, and efficient
sparsification
Graph classes of bounded tree rank were introduced recently in the context of the model checking problem for first-order logic of graphs. These graph classes are a common generalization of graph classes of bounded degree and bounded treedepth, and they are a special case of graph classes of bounded expansion. …