APA (7th ed.) Citation

Curticapean, R., Dell, H., & Roth, M. (2019). Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes. Theory of Computing Systems, 63(5), 987. https://doi.org/10.1007/s00224-018-9893-y

Chicago Style (17th ed.) Citation

Curticapean, Radu, Holger Dell, and Marc Roth. "Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes." Theory of Computing Systems 63, no. 5 (2019): 987. https://doi.org/10.1007/s00224-018-9893-y.

MLA (9th ed.) Citation

Curticapean, Radu, et al. "Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes." Theory of Computing Systems, vol. 63, no. 5, 2019, p. 987, https://doi.org/10.1007/s00224-018-9893-y.