Login / Signup

A new upper bound for the independence number of edge chromatic critical graphs.

Rong LuoYue Zhao
Published in: J. Graph Theory (2011)
Keyphrases
  • upper bound
  • small number
  • real time
  • data mining
  • maximum number
  • databases
  • decision trees
  • similarity measure
  • lower bound
  • special case
  • random variables
  • memory requirements
  • fixed number