Login / Signup

Improved bounds for the chromatic number of a graph.

S. Louis HakimiEdward F. Schmeichel
Published in: J. Graph Theory (2004)
Keyphrases
  • small number
  • real time
  • upper bound
  • graph matching
  • information systems
  • case study
  • support vector
  • special case
  • structured data
  • graph structure
  • maximum number
  • graph theoretic
  • upper and lower bounds
  • random graphs