Search
Now showing items 1-4 of 4
Edge maximal non-bipartite Hamiltonian graphs without theta graphs of order 7
(
Forum-Editrice Universitaria Udinese SRL
, 2019 , Article)
For a set of graphs F, let H(n; F) denote the class of non-bipartite Hamiltonian graphs on n vertices that does not contain any graph of F as a subgraph and h(n; F) = max{E(G): G ? H(n; F)} where E(G) is the number of edges ...
Edge-maximal graphs without θ 7 -graphs
(
Tokyo University of Science
, 2011 , Article)
Let G(n; θ2k+1, ≥ δ) denote the class of non-bipartite θ2k+1-free graphs on n vertices and minimum degree at least δ and let f (n; θ2k+1, ≥ δ) = max{ε(G): G ∈ G(n; θ2k+1, ≥ δ)}. In this paper we determinj an upker bound ...
The theta-complete graph Ramsey number r(θk, K5); k = 7, 8, 9
(
Forum-Editrice Universitaria Udinese SRL
, 2021 , Article)
Finding the Ramsey number is an important problem of the well-known
family of the combinatorial problems in Ramsey theory. In this work, we investigate
the Ramsey number r(θs, K5) for s = 7, 8, 9 where θs is the set of ...
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 ...