Login / Signup

The Ramsey number for a cycle of length five vs. a complete graph of order six.

Chula J. JayawardeneCecil C. Rousseau
Published in: J. Graph Theory (2000)
Keyphrases
  • maximum number
  • real time
  • search algorithm
  • data sets
  • computational complexity
  • np complete
  • connected components
  • graph partitioning
  • total length
  • minimal length