APA (7th ed.) Citation

Fellows, M., Heggernes, P., Rosamond, F., Sloper, C., & Telle, J. A. (2004, January). Finding k Disjoint Triangles in an Arbitrary Graph. Graph-Theoretic Concepts in Computer Science, 235-244. https://doi.org/10.1007/978-3-540-30559-0_20

Chicago Style (17th ed.) Citation

Fellows, Mike, Pinar Heggernes, Frances Rosamond, Christian Sloper, and Jan Arne Telle. "Finding K Disjoint Triangles in an Arbitrary Graph." Graph-Theoretic Concepts in Computer Science Jan. 2004: 235-244. https://doi.org/10.1007/978-3-540-30559-0_20.

MLA (9th ed.) Citation

Fellows, Mike, et al. "Finding K Disjoint Triangles in an Arbitrary Graph." Graph-Theoretic Concepts in Computer Science, Jan. 2004, pp. 235-244, https://doi.org/10.1007/978-3-540-30559-0_20.