The complexity of strong conflict-free vertex-connection $k$-colorability

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)
• Maximum $k$- vs. $\ell$-colourings of graphs
  di: Nakajima, Tamio-Vesa, et al.
  Pubblicazione: (2023)
• Asymptotically Optimal Inapproximability of E$k$-SAT Reconfiguration
  di: Hirahara, Shuichi, et al.
  Pubblicazione: (2025)
• Asymptotically Optimal Inapproximability of Maxmin $k$-Cut Reconfiguration
  di: Hirahara, Shuichi, et al.
  Pubblicazione: (2024)