2-factor
= 2-factor
A <spanning subgraph> in which every <vertex> has <vertex degree> two. In a finite <simple graph>, its <connected components of a graph> are <graph cycles>. Removing a <perfect matching> from a <cubic graph> leaves a <2-factor>.