51 citations · 101 across the 16 of their papers we have counts for
1 paper · 2 filters
Maël Dumas, Florent Foucaud, Anthony Perez +1
We show that if the edges or vertices of an undirected graph G can be covered by k shortest paths, then the pathwidth of G is upper-bounded by a single-exponential function o…