Login / Signup

A lower bound on the independence number of a graph in terms of degrees.

Jochen HarantIngo Schiermeyer
Published in: Discuss. Math. Graph Theory (2006)
Keyphrases
  • lower bound
  • upper bound
  • small number
  • constant factor
  • structured data
  • connected components
  • computational complexity
  • probabilistic model
  • graph partitioning