Sparse graphs with bounded induced cycle packing number have logarithmic treewidth

Documenti analoghi

• Maximum Independent Set when excluding an induced minor: $K_1 + tK_2$ and $tC_3 \uplus C_4$
  di: Bonnet, Édouard, et al.
  Pubblicazione: (2023)
• $χ$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs
  di: Bonamy, Marthe, et al.
  Pubblicazione: (2025)
• First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs
  di: Geniet, Colin, et al.
  Pubblicazione: (2022)
• Faithful universal graphs for minor-closed classes
  di: Bastide, Paul, et al.
  Pubblicazione: (2025)
• Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
  di: Bonamy, Marthe, et al.
  Pubblicazione: (2025)