Login / Signup

Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes.

Maria ChudnovskyAlex ScottPaul D. SeymourSophie Spirkl
Published in: J. Comb. Theory, Ser. B (2020)
Keyphrases
  • computational complexity
  • fixed number
  • finite number
  • graph mining
  • data structure
  • lower bound
  • color images
  • small number
  • maximum number