Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Distance-Based Covering Problems for Graphs of Given Cyclomatic Number

    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 be removed from the graph to ...

    Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen in Fundamentals of Computation Theory (2023)