Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference18 articles.
1. On the complexity and combinatorics of covering finite complexes;Abello;Aust. J. Comb.,1991
2. Set partitioning via inclusion–exclusion;Björklund;SIAM J. Comput.,2009
3. Circular distance two labeling and the λ-number for outerplanar graphs;Liu;SIAM J. Discrete Math.,2005
4. Graph Theory;Diestel,2010
5. Complexity of partial covers of graphs;Fiala,2001
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献