Decomposability of a class of k-cutwidth critical graphs

MLA

Liu-Yong Pang, et al. “Decomposability of a Class of K-Cutwidth Critical Graphs.” Journal of Combinatorial Optimization, vol. 43, July 2021, pp. 384–401. 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...........34818dc356c5ed3a01f1ff8ab5b220b6&authtype=sso&custid=ns315887.

APA

Liu-Yong Pang, Zhong Zhao, & Zhen-Kun Zhang. (2021). Decomposability of a class of k-cutwidth critical graphs. Journal of Combinatorial Optimization, 43, 384–401.

Chicago

Liu-Yong Pang, Zhong Zhao, and Zhen-Kun Zhang. 2021. “Decomposability of a Class of K-Cutwidth Critical Graphs.” Journal of Combinatorial Optimization 43 (July): 384–401. 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...........34818dc356c5ed3a01f1ff8ab5b220b6&authtype=sso&custid=ns315887.