Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs

Documenti analoghi

• The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability
  di: Feghali, Carl, et al.
  Pubblicazione: (2025)
• The complexity of strong conflict-free vertex-connection $k$-colorability
  di: Hsieh, Sun-Yuan, et al.
  Pubblicazione: (2024)
• A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
  di: Beisegel, Jesse, et al.
  Pubblicazione: (2025)
• Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
  di: Le, Hoang-Oanh, et al.
  Pubblicazione: (2023)
• Computing Subset Vertex Covers in $H$-Free Graphs
  di: Brettell, Nick, et al.
  Pubblicazione: (2023)