Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles

Documenti analoghi

• Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs
  di: Le, Hoang-Oanh, et al.
  Pubblicazione: (2024)
• The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability
  di: Feghali, Carl, et al.
  Pubblicazione: (2025)
• Non-crossing $H$-graphs: a generalization of proper interval graphs admitting FPT algorithms
  di: Bonomo-Braberman, Flavia, et al.
  Pubblicazione: (2025)
• Complexity results for a cops and robber game on directed graphs
  di: Ben-Ameur, Walid, et al.
  Pubblicazione: (2024)
• The complexity of strong conflict-free vertex-connection $k$-colorability
  di: Hsieh, Sun-Yuan, et al.
  Pubblicazione: (2024)