Login / Signup

More tales of Hoffman: bounds for the vector chromatic number of a graph.

Pawel WocjanClive ElphickDavid Anekstein
Published in: Discuss. Math. Graph Theory (2023)
Keyphrases
  • small number
  • upper bound
  • computational complexity
  • connected components
  • graph theory
  • closed form expressions