On pseudo 2-factors
We show that a graph with minimum degree ? ? , independence number ??? ? ? ? and without isolated vertices, possesses a partition by vertex-disjoint cycles and at most ???+1 ? ? ? + 1 edges or vertices.
pseudo 2-factor 2-factor minimum degree independence number cycle