The complexity of regular subgraph recognition
暂无分享,去创建一个
Abstract Given a graph G we wish to determine whether it contains a partial k -regular subgraph. In this paper it is shown that this problem is NP-complete for graphs with maximum degree k +1 when k ≥3. (The k =1,2 cases are trivially solvable in polynomial time.) The k -regular subgraph problem remains NP-complete when G is restricted to Hamiltonian or Eulerian graphs. We also examine the cases where the k -regular subgraph is further restricted to being spanning and/or connected.
[1] K. M. Koh,et al. Concentric subgraphs, closed subsets and dense graphs , 1984 .
[2] J. Petersen. Die Theorie der regulären graphs , 1891 .
[3] Carsten Thomassen,et al. Three-regular subgraphs of four-regular graphs , 1979, J. Graph Theory.
[4] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[5] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..