Maximum Independent Set when excluding an induced minor: $K_1 + tK_2$ and $tC_3 \uplus C_4$

Documenti analoghi

• First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs
  di: Geniet, Colin, et al.
  Pubblicazione: (2022)
• Unavoidable induced subgraphs in graphs with complete bipartite induced minors
  di: Chudnovsky, Maria, et al.
  Pubblicazione: (2024)
• Temporalizing digraphs via linear-size balanced bi-trees
  di: Bessy, Stéphane, et al.
  Pubblicazione: (2023)
• Mim-Width is paraNP-complete
  di: Bergougnoux, Benjamin, et al.
  Pubblicazione: (2025)
• Moderately beyond clique-width: reduced component max-leaf and related parameters
  di: Bonnet, Édouard, et al.
  Pubblicazione: (2026)