8 citations · 12 across the 6 of their papers we have counts for
1 paper · 1 filter
Jeremy Kun, Michael P. O'Brien, Marcin Pilipczuk +1
Low-treedepth colorings are an important tool for algorithms that exploit structure in classes of bounded expansion; they guarantee subgraphs that use few colors have bounded treed…