Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument

Documenti analoghi

• Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
  di: Majewski, Konrad, et al.
  Pubblicazione: (2022)
• Optimal distance query reconstruction for graphs without long induced cycles
  di: Bastide, Paul, et al.
  Pubblicazione: (2023)
• Bounding $\varepsilon$-scatter dimension via metric sparsity
  di: Bourneuf, Romain, et al.
  Pubblicazione: (2024)
• On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
  di: MacRury, Calum, et al.
  Pubblicazione: (2022)
• Lower Bounds for Leaf Rank of Leaf Powers
  di: Høgemo, Svein
  Pubblicazione: (2024)