On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors

Asish Mukhopadhyay, Daniel John, Lucas Sarweh

In this note, we consider the problem of generating $k$-factorable graphic sequences with connected (resp. no connected) $k$-factors.