Login / Signup

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.

Marthe BonamyÉdouard BonnetHugues DéprésLouis EsperetColin GenietClaire HilaireStéphan ThomasséAlexandra Wesolek
Published in: J. Comb. Theory B (2024)
Keyphrases
  • bounded treewidth
  • high dimensional
  • small number
  • space complexity
  • maximum number
  • reduced set