Funder
Grantová Agentura České Republiky
Univerzita Karlova v Praze
Polska Akademia Nauk
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference46 articles.
1. Abello, J., Fellows, M.R., Stillwell, J.C.: On the complexity and combinatorics of covering finite complexes. Aust. J. Comb. 4, 103–112 (1991)
2. Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th ACM Symposium on Theory of Computing, pp. 82–93 (1980)
3. Bard, S., Bellitto, T., Duffy, C., MacGillivray, G., Yang, F.: Complexity of locally-injective homomorphisms to tournaments. Discrete Math. Theor. Comput. Sci. 20(2), (2018). http://dmtcs.episciences.org/4999
4. Biggs, N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1974)
5. Bílka, O., Lidický, B., Tesar, M.: Locally injective homomorphism to the simple weight graphs. In: Ogihara, M., Tarui, J. (eds.) Theory and Applications of Models of Computation—8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings. Lecture Notes in Computer Science, vol. 6648, pp. 471–482. Springer (2011). https://doi.org/10.1007/978-3-642-20877-5_46
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献