4 research outputs found

    Three results on cycle-wheel Ramsey numbers

    Get PDF
    Given two graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer N such that, for any graph G of order N, either G1 is a subgraph of G, or G2 is a subgraph of the complement of G. We consider the case that G1 is a cycle and G2 is a (generalized) wheel. We expand the knowledge on exact values of Ramsey numbers in three directions: large cycles versus wheels of odd order; large wheels versus cycles of even order; and large cycles versus generalized odd wheels

    On the Circumference of a Graph and its Complement

    Get PDF
    https://digitalcommons.memphis.edu/speccoll-faudreerj/1059/thumbnail.jp
    corecore