Cite
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.
MLA
Bonamy, Marthe, et al. “Sparse Graphs with Bounded Induced Cycle Packing Number Have Logarithmic Treewidth.” Journal of Combinatorial Theory - Series B, vol. 167, July 2024, pp. 215–49. EBSCOhost, https://doi.org/10.1016/j.jctb.2024.03.003.
APA
Bonamy, M., Bonnet, É., Déprés, H., Esperet, L., Geniet, C., Hilaire, C., Thomassé, S., & Wesolek, A. (2024). Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. Journal of Combinatorial Theory - Series B, 167, 215–249. https://doi.org/10.1016/j.jctb.2024.03.003
Chicago
Bonamy, Marthe, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, and Alexandra Wesolek. 2024. “Sparse Graphs with Bounded Induced Cycle Packing Number Have Logarithmic Treewidth.” Journal of Combinatorial Theory - Series B 167 (July): 215–49. doi:10.1016/j.jctb.2024.03.003.