Add to ORKGLet $H$ be a graph. The generalized outerplanar Tur\'an number of $H$, denoted by $f_{\mathcal{OP}}(n,H)$, is the maximum number of copies of $H$ in an $n$-vertex outerplanar graph. Let $P_k$ be the path on $k$ vertices. In this paper we give an exact value of $f_{\mathcal{OP}}(n,P_4)$ and a best asymptotic value of $f_{\mathcal{OP}}(n,P_5)$. Moreover, we characterize all outerplanar graphs containing $f_{\mathcal{OP}}(n,P_4)$ copies of $P_4$.Comment: 23 pages, 12 figure
A map is outerplanar if all its vertices lie in the outer face. We enumerate various classes of root...
Let $P_4$ denote the path graph on $4$ vertices. The suspension of $P_4$, denoted by $\widehat P_4$,...
Let $P_4$ denote the path graph on $4$ vertices. The suspension of $P_4$, denoted by $\widehat P_4$,...
International audienceA path-decomposition of a graph G = (V, E) is a sequence of subsets of V , cal...
A path-decomposition of a graph G = (V, E) is a sequence of subsets of V , called bags, that satisfy...
A map is outerplanar if all its vertices lie in the outer face. We enumerate various classes of root...
The Turán number of a graph H, denoted by ex(n, H), is the maximum number of edges in any graph on n...
For n-vertex outerplanar graphs, it is proven that O(n 2.87) is an upper bound on the number of brea...
Let G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symmetric mat...
Let G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symmetric mat...
Let G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symmetric mat...
Let G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symmetric mat...
Let G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symmetric mat...
AbstractLet G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symme...
Abstract. The Turán number of a graph H, ex(n,H), is the maximum number of edges in any graph on n ...
A map is outerplanar if all its vertices lie in the outer face. We enumerate various classes of root...
Let $P_4$ denote the path graph on $4$ vertices. The suspension of $P_4$, denoted by $\widehat P_4$,...
Let $P_4$ denote the path graph on $4$ vertices. The suspension of $P_4$, denoted by $\widehat P_4$,...
International audienceA path-decomposition of a graph G = (V, E) is a sequence of subsets of V , cal...
A path-decomposition of a graph G = (V, E) is a sequence of subsets of V , called bags, that satisfy...
A map is outerplanar if all its vertices lie in the outer face. We enumerate various classes of root...
The Turán number of a graph H, denoted by ex(n, H), is the maximum number of edges in any graph on n...
For n-vertex outerplanar graphs, it is proven that O(n 2.87) is an upper bound on the number of brea...
Let G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symmetric mat...
Let G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symmetric mat...
Let G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symmetric mat...
Let G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symmetric mat...
Let G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symmetric mat...
AbstractLet G=(V,E) be a graph with V={1,2,…,n}. Define S(G) as the set of all n×n real-valued symme...
Abstract. The Turán number of a graph H, ex(n,H), is the maximum number of edges in any graph on n ...
A map is outerplanar if all its vertices lie in the outer face. We enumerate various classes of root...
Let $P_4$ denote the path graph on $4$ vertices. The suspension of $P_4$, denoted by $\widehat P_4$,...
Let $P_4$ denote the path graph on $4$ vertices. The suspension of $P_4$, denoted by $\widehat P_4$,...