Login / Signup

Sharp upper bounds on the Clar number of fullerene graphs.

Yang GaoHeping Zhang
Published in: Discuss. Math. Graph Theory (2018)
Keyphrases
  • upper bound
  • lower bound
  • data sets
  • high quality
  • computational complexity
  • active learning
  • branch and bound algorithm
  • fixed number