5 citations · 5 across the 8 of their papers we have counts for
1 paper · 1 filter
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…