بحث بسيط
السجلات المعروضة 1 -- 1 من 1
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, ...