A Classification of Connected f -factor Problems inside NP

N. S. Narayanaswamy, C. S. Rahul

Given an undirected graph G = (V, E) with n vertices, and a function f : V -> N, we consider the problem of finding a connected f -factor in G. In this work we design an algorithm…