• A note on the Ramsey numbers for theta graphs versus the wheel of order 5 

      Jaradat M.M.M.; Bataineh M.S.; Vetr?k T.; Rabaiah A.M.M. ( Kalasalingam University , 2018 , Article)
      The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of problems in the extremal graph theory. For a set of graphs S and a graph F, the Ramsey number R(S,F) is the smallest positive ...
    • The Ramsey number for two graphs of order 5 

      Bataineh M.S.; Vetrik T.; Jaradat M.M.M.; Rabaiah A.M.M. ( Taylor and Francis Ltd. , 2018 , Article)
      For two graphs F1 and F2, the Ramsey number R(F1, F2) is the smallest positive integer r such that for every graph G on r vertices, G contains F1 as a subgraph or the complement of G contains F2 as a subgraph. We present ...