Cite
The Complexity of Helly-B1-EPG graph Recognition.
MLA
Bornstein, Claudson F., et al. “The Complexity of Helly-B1-EPG Graph Recognition.” Discrete Mathematics & Theoretical Computer Science (DMTCS), vol. 22, no. 1, Jan. 2020, pp. 1–24. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=asx&AN=145502951&authtype=sso&custid=ns315887.
APA
Bornstein, C. F., Golumbic, M. C., Santos, T. D., Souza, U. S., & Szwarcfiter, J. L. (2020). The Complexity of Helly-B1-EPG graph Recognition. Discrete Mathematics & Theoretical Computer Science (DMTCS), 22(1), 1–24.
Chicago
Bornstein, Claudson F., Martin Charles Golumbic, Tanilson D. Santos, Uéverton S. Souza, and Jayme L. Szwarcfiter. 2020. “The Complexity of Helly-B1-EPG Graph Recognition.” Discrete Mathematics & Theoretical Computer Science (DMTCS) 22 (1): 1–24. http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=asx&AN=145502951&authtype=sso&custid=ns315887.