Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs

Documenti analoghi

• An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
  di: An, Shinwoo, et al.
  Pubblicazione: (2025)
• Largest common subgraph of two forests
  di: Rautenbach, Dieter, et al.
  Pubblicazione: (2024)
• On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
  di: Munaro, Andrea, et al.
  Pubblicazione: (2022)
• Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
  di: Bencs, Ferenc, et al.
  Pubblicazione: (2025)
• Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
  di: Deák, Bence, et al.
  Pubblicazione: (2026)