Login / Signup

The Ramsey number for theta graph versus a clique of order three and four.

Mohammed S. A. BatainehM. S. BateehaMohammed M. M. Jaradat
Published in: Discuss. Math. Graph Theory (2014)
Keyphrases
  • computational complexity
  • small number
  • graph matching
  • np hard