Login / Signup

A lower bound on the independence number of a graph in terms of degrees and local clique sizes.

Christoph BrauseBert RanderathDieter RautenbachIngo Schiermeyer
Published in: Discret. Appl. Math. (2016)
Keyphrases
  • lower bound
  • small number
  • upper bound
  • computational complexity
  • branch and bound
  • worst case
  • directed graph