Funder
FAPERJ, CNPq, CAPES Brazilian Research Agencies, EPSRC
Leverhulme Trust
DE-MO-GRAPH
Subject
General Computer Science,Theoretical Computer Science
Reference39 articles.
1. On the (parameterized) complexity of recognizing well-covered (r,ℓ)-graphs;Alves,2016
2. Partitions of graphs into one or two independent sets and cliques;Brandstädt;Discrete Math.,1996
3. New graph classes of bounded clique-width;Brandstädt;Theory Comput. Syst.,2005
4. A note on well-covered graphs;Chvátal;Ann. Discrete Math.,1993
5. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs;Courcelle;Inform. and Comput.,1990
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献