Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number

Documenti analoghi

• QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
  di: Bonnet, Édouard, et al.
  Pubblicazione: (2026)
• Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
  di: Chudnovsky, Maria, et al.
  Pubblicazione: (2024)
• Max Weight Independent Set in sparse graphs with no long claws
  di: Abrishami, Tara, et al.
  Pubblicazione: (2023)
• Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
  di: Bodlaender, Hans L., et al.
  Pubblicazione: (2025)
• Kernelization for list $H$-coloring for graphs with small vertex cover
  di: Piecyk, Marta, et al.
  Pubblicazione: (2025)