An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure

Documenti analoghi

• A new width parameter of graphs based on edge cuts: $α$-edge-crossing width
  di: Chang, Yeonsu, et al.
  Pubblicazione: (2023)
• Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
  di: Galby, Esther, et al.
  Pubblicazione: (2025)
• Largest common subgraph of two forests
  di: Rautenbach, Dieter, et al.
  Pubblicazione: (2024)
• Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs
  di: Le, Hoang-Oanh, et al.
  Pubblicazione: (2024)
• Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
  di: Bencs, Ferenc, et al.
  Pubblicazione: (2025)