APA (7th ed.) Citation

Adler, I., & Köhler, N. (2022). An explicit construction of graphs of bounded degree that are far from being Hamiltonian. Discrete Mathematics and Theoretical Computer Science, 24, no. 1(Graph Theory), 1-19. https://doi.org/10.46298/dmtcs.7109

Chicago Style (17th ed.) Citation

Adler, Isolde, and Noleen Köhler. "An Explicit Construction of Graphs of Bounded Degree That Are Far from Being Hamiltonian." Discrete Mathematics and Theoretical Computer Science 24, no. 1, no. Graph Theory (2022): 1-19. https://doi.org/10.46298/dmtcs.7109.

MLA (9th ed.) Citation

Adler, Isolde, and Noleen Köhler. "An Explicit Construction of Graphs of Bounded Degree That Are Far from Being Hamiltonian." Discrete Mathematics and Theoretical Computer Science, vol. 24, no. 1, no. Graph Theory, 2022, pp. 1-19, https://doi.org/10.46298/dmtcs.7109.