Login / Signup

Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure.

Clément DallardMartin MilanicKenny Storgel
Published in: J. Comb. Theory B (2024)
Keyphrases
  • small number
  • computational complexity
  • upper bound
  • graph structure