Bisplit graphs

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[[email protected]?S] are more than one complete bipartite subgraph.

[1]  Andreas Brandstädt,et al.  The Complexity of some Problems Related to Graph 3-colorability , 1998, Discret. Appl. Math..

[2]  T. Gallai.  Transitiv orientierbare Graphen , 1967 .

[3]  Vasek Chvátal,et al.  Recognizing decomposable graphs , 1984, J. Graph Theory.

[4]  Russell Merris,et al.  Split graphs , 2003, Eur. J. Comb..

[5]  D. König.  Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .

[6]  Feodor F. Dragan,et al.  On stable cutsets in graphs , 2000, Discret. Appl. Math..

[7]  Alan Tucker.  Coloring graphs with stable cutsets , 1983, J. Comb. Theory, Ser. B.

[8]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[9]  Chính T. Hoàng,et al.  On P4-transversals of perfect graphs , 2000, Discret. Math..

[10]  C. Figueiredo,et al.  The NP-completeness of multi-partite cutset testing , 1996 .

[11]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  G. Winskel.  What Is Discrete Mathematics , 2007 .

[14]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[15]  Jeremy P. Spinrad,et al.  Modular decomposition and transitive orientation , 1999, Discret. Math..

[16]  Sulamita Klein,et al.  List Partitions , 2003, SIAM J. Discret. Math..

[17]  Jean Fonlupt,et al.  Stable Set Bonding in Perfect Graphs and Parity Graphs , 1993, J. Comb. Theory, Ser. B.