APA (7th ed.) Citation

Jaffe, A. (2021). Characterizing Bipartite Graphs Which Admit a k-NU Polymorphism via Absolute Retracts. Graphs & Combinatorics, 37(6), 2459. https://doi.org/10.1007/s00373-021-02367-w

Chicago Style (17th ed.) Citation

Jaffe, Adam. "Characterizing Bipartite Graphs Which Admit a K-NU Polymorphism via Absolute Retracts." Graphs & Combinatorics 37, no. 6 (2021): 2459. https://doi.org/10.1007/s00373-021-02367-w.

MLA (9th ed.) Citation

Jaffe, Adam. "Characterizing Bipartite Graphs Which Admit a K-NU Polymorphism via Absolute Retracts." Graphs & Combinatorics, vol. 37, no. 6, 2021, p. 2459, https://doi.org/10.1007/s00373-021-02367-w.