Author:
Fiala Jiří,Kratochvíl Jan
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Abello, J., Fellows, M. R., and Stillwell, J. C. On the complexity and combinatorics of covering finite complexes. Australian Journal of Combinatorics 4 (1991), 103–112.
2. Angluin, D. Local and global properties in networks of processors. Proceedings of the 12th ACM Symposium on Theory of Computing (1980), 82–93.
3. Angluin, D., and Gardiner, A. Finite common coverings of pairs of regular graphs. Journal of Combinatorial Theory B 30 (1981), 184–187.
4. Biggs, N. Algebraic Graph Theory. Cambridge University Press, 1974.
5. Bodlaender, H. L. The classification of coverings of processor networks. Journal of Parallel Distributed Computing 6 (1989), 166–182.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献