Erdős-Gyárfás conjecture on graphs without long induced paths

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)
• Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
  di: Bourneuf, Romain, et al.
  Pubblicazione: (2025)
• On the complexity of edge subdivision to $H$-free graphs
  di: Piecyk, Marta, et al.
  Pubblicazione: (2026)
• Switching Classes: Characterization and Computation
  di: Antony, Dhanyamol, et al.
  Pubblicazione: (2024)
• Optimal distance query reconstruction for graphs without long induced cycles
  di: Bastide, Paul, et al.
  Pubblicazione: (2023)