Author:
Feder Tomás,Hell Pavol,Hochstättler Winfried
Reference19 articles.
1. A. Brandstädt, Partitions of graphs into one or two stable sets and cliques, Discrete Math. 152 (1996) 47–54.
2. A. Brandstädt, V.B. Le, and J.P. Spinrad, Graph Classes: A Survey, SIAM Monographs on Discrete Math. and Applications 1999.
3. K. Cameron, E.M. Eschen, C.T. Hoang, and R. Sritharan, The list partition problem for graphs, SODA 2004.
4. D.G. Corneil, H. Lerchs, and L. Stewart Burlingham, Complement reducible graphs, Discrete Applied Math. 3 (1981) 163–174.
5. D.G. Corneil, Y. Perl, and L.K. Stewart, A linear recognition algorithm for cographs, SIAM. J. Computing 14 (1985) 926–934.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献