Induced matching treewidth and tree-independence number, revisited

Documenti analoghi

• Tree-independence number of $P_5$-free graphs with no large bicliques
  di: Blažej, Václav, et al.
  Pubblicazione: (2026)
• Clique-width and induced topological minors
  di: Bieliński, Paweł Rafał, et al.
  Pubblicazione: (2026)
• Polynomial-time recognition and maximum independent set in Burling graphs
  di: Rzążewski, Paweł, et al.
  Pubblicazione: (2024)
• 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)
• Clustered independence and bounded treewidth
  di: Knauer, Kolja, et al.
  Pubblicazione: (2023)