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

Asish Mukhopadhyay; Daniel John; Lucas Sarweh

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

Data Structures and Algorithms 2024-10-28 v1 Combinatorics

Authors: Asish Mukhopadhyay , Daniel John , Lucas Sarweh

Abstract

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

Keywords

k-factorable graphic sequences connected k-factors graph theory graphic sequences

Cite

@article{arxiv.2410.18999,
  title  = {On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors},
  author = {Asish Mukhopadhyay and Daniel John and Lucas Sarweh},
  journal= {arXiv preprint arXiv:2410.18999},
  year   = {2024}
}