Maximum Partial List H-Coloring on P_5-free graphs in polynomial time

Documenti analoghi

• Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time
  di: Agrawal, Akanksha, et al.
  Pubblicazione: (2024)
• FPT Approximations for Connected Maximum Coverage
  di: Inamdar, Tanmay, et al.
  Pubblicazione: (2026)
• Subexponential Parameterized Algorithms for Hitting Subgraphs
  di: Lokshtanov, Daniel, et al.
  Pubblicazione: (2024)
• List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
  di: Esmer, Barış Can, et al.
  Pubblicazione: (2022)
• Balanced Substructures in Bicolored Graphs
  di: Ardra, P. S., et al.
  Pubblicazione: (2024)