Login / Signup

Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations.

Fengming DongJun GeHelin GongBo NingZhangdong OuyangEng Guan Tay
Published in: J. Graph Theory (2021)
Keyphrases
  • np hard
  • maximum number
  • neural network
  • color images
  • information retrieval
  • relational databases
  • small number
  • database
  • lower bound
  • special case
  • np complete