Author:
Martin Barnaby,Paulusma Daniël
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference35 articles.
1. Edge-contraction problems;Asano;J. Comput. System Sci.,1983
2. On stable cutsets in graphs;Brandstädt;Discrete Appl. Math.,2000
3. Tractable conservative constraint satisfaction problems;Bulatov,2003
4. Classifying the complexity of constraints using finite algebras;Bulatov;SIAM J. Comput.,2005
5. The complexity of the list partition problem for graphs;Cameron;SIAM J. Discrete Math.,2007
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献