Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs

MLA

Jixiang Meng, et al. “Nonseparating Trees in 2-Connected Graphs and Oriented Trees in Strongly Connected Digraphs.” Discrete Mathematics, vol. 342, Feb. 2019, pp. 344–51. 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=edsair&AN=edsair.doi.dedup.....6ff980da3525bf112fd512a60712de58&authtype=sso&custid=ns315887.

APA

Jixiang Meng, Hong-Jian Lai, Yingzhi Tian, & Liqiong Xu. (2019). Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs. Discrete Mathematics, 342, 344–351.

Chicago

Jixiang Meng, Hong-Jian Lai, Yingzhi Tian, and Liqiong Xu. 2019. “Nonseparating Trees in 2-Connected Graphs and Oriented Trees in Strongly Connected Digraphs.” Discrete Mathematics 342 (February): 344–51. 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=edsair&AN=edsair.doi.dedup.....6ff980da3525bf112fd512a60712de58&authtype=sso&custid=ns315887.