A Characterization for the Existence of Connected $f$-Factors of $\text{ Large}$ Minimum Degree

N S Narayanaswamy, C S Rahul

It is well known that when $f(v)$ is a constant for each vertex $v$, the connected $f$-factor problem is NP-Complete. In this note we consider the case when $f(v) \geq \lceil \frac…