Bonnet, É., Hodor, J., Korhonen, T., & Masařík, T. (2023). Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor.
Cita Chicago Style (17a ed.)Bonnet, Édouard, Jędrzej Hodor, Tuukka Korhonen, y Tomáš Masařík. Treewidth Is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor. 2023.
Cita MLA (9a ed.)Bonnet, Édouard, et al. Treewidth Is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor. 2023.
Precaución: Estas citas no son 100% exactas.