Search
Now showing items 1-2 of 2
Edge-Maximal θ2k+1-Edge Disjoint Free Graphs
(
Kyungmoon Publishing
, 2014 , Article)
For two positive integers r and s, G(n; r; θs) denotes to the class of graphs
on n vertices containing no r of edge disjoint θs-graphs and f(n; r; θs) = max{E(G) :
G ∈ G(n; r; θs)}. In this paper, for integers r, k ≥ 2, ...
The ramsey number for theta graph versus a clique of order three and four
(
University of Zielona Gora
, 2014 , Article)
For any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is
the smallest positive integer N with the property that every graph on at
least N vertices contains F1 or its complement contains F2 as a subgraph.
In ...