Distance-based (and path-based) covering problems for graphs of given cyclomatic number

Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen

We study a large family of graph covering problems, whose definitions rely on distances, for graphs of bounded cyclomatic number (that is, the minimum number of edges that need to…