Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference26 articles.
1. On easy and hard hereditary classes of graphs with respect to the independent set problem;Alekseev;Discrete Applied Mathematics,2004
2. Complete description of forbidden subgraphs in the structural domination problem;Bacsó;Discrete Mathematics,2009
3. Dominating cliques in P5-free graphs;Bacsó;Periodica Mathematica Hungarica,1990
4. On clique separators, nearly chordal graphs and the Maximum Weight Stable Set Problem;Brandstädt,2005
5. P6- and triangle-free graphs revisited: Structure and bounded clique-width;Brandstädt;Discrete Mathematics and Theoretical Computer Science,2006
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献