Author:
Bílka Ondřej,Lidický Bernard,Tesař Marek
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Abello, J., Fellows, M.R., Stillwell, J.C.: On the complexity and combinatorics of covering finite complexes. Australian Journal of Combinatorics 4, 103–112 (1991)
2. Bodlaender, H.L.: The classification of coverings of processor networks. Journal of Parallel Distributed Computing 6, 166–182 (1989)
3. Feder, T., Vardi, M.Y.: Monotone monadic SNP and constraint satisfaction. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 612–622 (1993)
4. Fiala, J.: NP completeness of the edge precoloring extension problem on bipartite graphs. Journal of Graph Theory 43, 156–160 (2003)
5. Fiala, J.: Locally injective homomorphisms, disertation thesis (2000)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献