Abstract
An undirected graph G = ( V , E ) is a bisplit graph if its vertex set can be partitioned into a stable set and a complete bipartite graph. We provide an O ( | V | | E | ) time recognition algorithm for these graphs and characterize them in terms of forbidden induced subgraphs. We also discuss the problem of recognizing whether G has a stable set S such that the connected components of G [ V ⧹ S ] are more than one complete bipartite subgraph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
