APA (7th ed.) Citation

Gribanov, D., & Malyshev, D. (2017). The computational complexity of three graph problems for instances with bounded minors of constraint matrices. Discrete Applied Mathematics, 227, 13-20. https://doi.org/10.1016/j.dam.2017.04.025

Chicago Style (17th ed.) Citation

Gribanov, D.V, and D.S Malyshev. "The Computational Complexity of Three Graph Problems for Instances with Bounded Minors of Constraint Matrices." Discrete Applied Mathematics 227 (2017): 13-20. https://doi.org/10.1016/j.dam.2017.04.025.

MLA (9th ed.) Citation

Gribanov, D.V, and D.S Malyshev. "The Computational Complexity of Three Graph Problems for Instances with Bounded Minors of Constraint Matrices." Discrete Applied Mathematics, vol. 227, 2017, pp. 13-20, https://doi.org/10.1016/j.dam.2017.04.025.