Jobson, A. S., Kézdy, A. E., & Lehel, J. (2021). Minimal 2-connected graphs satisfying the even cut condition. Information Processing Letters, 167, N.PAG. https://doi.org/10.1016/j.ipl.2020.106080
Chicago Style (17th ed.) CitationJobson, Adam S., André E. Kézdy, and Jenő Lehel. "Minimal 2-connected Graphs Satisfying the Even Cut Condition." Information Processing Letters 167 (2021): N.PAG. https://doi.org/10.1016/j.ipl.2020.106080.
MLA (9th ed.) CitationJobson, Adam S., et al. "Minimal 2-connected Graphs Satisfying the Even Cut Condition." Information Processing Letters, vol. 167, 2021, p. N.PAG, https://doi.org/10.1016/j.ipl.2020.106080.
Warning: These citations may not always be 100% accurate.