Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
On generating -factorable graphic sequences with connected (resp.no connected) -factors
Asish Mukhopadhyay, Daniel John, Lucas Sarweh
In this note, we consider the problem of generating -factorable graphic sequences with connected (resp. no connected) -factors.
cs.DS2023
Recognizing and generating unswitchable graphs
Asish Mukhopadhyay, Daniel John, Srivatsan Vasudevan
In this paper, we show that unswitchable graphs are a proper subclass of split graphs, and exploit this fact to propose efficient algorithms for their recognition and generation.