Recognizing and generating unswitchable graphs
arXiv:2304.12381
Abstract
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.
13 pages, 14 figures