Tree-independence number of $P_5$-free graphs with no large bicliques

Documenti analoghi

• Induced matching treewidth and tree-independence number, revisited
  di: Alon, Noga, et al.
  Pubblicazione: (2025)
• A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
  di: Pilipczuk, Marcin, et al.
  Pubblicazione: (2023)
• Constant congestion brambles in directed graphs
  di: Masařík, Tomáš, et al.
  Pubblicazione: (2021)
• Polynomial-time recognition and maximum independent set in Burling graphs
  di: Rzążewski, Paweł, et al.
  Pubblicazione: (2024)
• Hitting all longest paths in $H$-free graphs and $H$-graphs
  di: de Lima, Paloma T., et al.
  Pubblicazione: (2025)