A POLYNOMIAL ALGORITHM FOR FINDING THEMINIMUM FEEDBACK VERTEX SET OF A3-REGULAR SIMPLE GRAPH

摘要

A subset of the vertex set of a graph is a feedback vcrtex set of the graph if theresulting graph is a forest after removed the vertex subset from the graph. A polynomialalgorithm for finding a minimum feedback vertex set of a 3-regular simple graph is provided.