APA (7th ed.) Citation

Le, H., & Le, V. B. (2026). Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles. Journal of computer and system sciences, 156, 103723. https://doi.org/10.1016/j.jcss.2025.103723

Chicago Style (17th ed.) Citation

Le, Hoang-Oanh, and Van Bang Le. "Complexity and Algorithms for Matching Cut Problems in Graphs Without Long Induced Paths and Cycles." Journal of Computer and System Sciences 156 (2026): 103723. https://doi.org/10.1016/j.jcss.2025.103723.

MLA (9th ed.) Citation

Le, Hoang-Oanh, and Van Bang Le. "Complexity and Algorithms for Matching Cut Problems in Graphs Without Long Induced Paths and Cycles." Journal of Computer and System Sciences, vol. 156, 2026, p. 103723, https://doi.org/10.1016/j.jcss.2025.103723.