Cite
Tight toughness bounds for path-factor critical avoidable graphs
MLA
Wenqi Wang, and Guowei Dai. “Tight Toughness Bounds for Path-Factor Critical Avoidable Graphs.” AKCE International Journal of Graphs and Combinatorics, vol. 21, no. 2, May 2024, pp. 167–70. EBSCOhost, https://doi.org/10.1080/09728600.2024.2314512.
APA
Wenqi Wang, & Guowei Dai. (2024). Tight toughness bounds for path-factor critical avoidable graphs. AKCE International Journal of Graphs and Combinatorics, 21(2), 167–170. https://doi.org/10.1080/09728600.2024.2314512
Chicago
Wenqi Wang, and Guowei Dai. 2024. “Tight Toughness Bounds for Path-Factor Critical Avoidable Graphs.” AKCE International Journal of Graphs and Combinatorics 21 (2): 167–70. doi:10.1080/09728600.2024.2314512.