Abstract

The Co-Path/Cycle Packing problem that tries to find a set of vertices that, when removed, leaves a graph of maximum degree 2 is a prominent problem in the graph theory field. The related Vertex Cover problem, which finds a deletion set where the remaining graph has maximum degree 0,
... read more