Linear Recognition of Pseudo-split Graphs
暂无分享,去创建一个
We characterize the graphs with no induced 2K2 or C4 and present a linear-time recognition algorithm.
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] Zsolt Tuza,et al. Graphs with no induced C4 and 2K2 , 1993, Discret. Math..
[3] Peter L. Hammer,et al. The splittance of a graph , 1981, Comb..
[4] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .