1 paper · 1 filter
Roman Nedela, Michaela Seifrtová, Martin Škoviera
A set of vertices of a graph G is said to be decycling if its removal leaves an acyclic subgraph. The size of a smallest decycling set is the decycling number of G. Generally,…