TY - JOUR

T1 - On The Number of Subgraphs of Prescribed Type of Planar Graphs With A Given Number of Vertices

AU - Alon, N.

AU - Caro, Y.

PY - 1984

Y1 - 1984

N2 - For a planar graph H and a positive integer n we study the maximal number f = f(n, H), such that there exists a planar graph on n vertices containing f subgraphs isomorphic to H. We determine f(n, H) precisely if H is either a complete bipartite (planar) graph or a maximal planar graph without triangles that are not faces, and estimate f(n, H) for every maximal planar graph H.

AB - For a planar graph H and a positive integer n we study the maximal number f = f(n, H), such that there exists a planar graph on n vertices containing f subgraphs isomorphic to H. We determine f(n, H) precisely if H is either a complete bipartite (planar) graph or a maximal planar graph without triangles that are not faces, and estimate f(n, H) for every maximal planar graph H.

UR - http://www.scopus.com/inward/record.url?scp=77956909323&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956909323&partnerID=8YFLogxK

U2 - 10.1016/S0304-0208(08)72803-2

DO - 10.1016/S0304-0208(08)72803-2

M3 - Article

AN - SCOPUS:77956909323

VL - 87

SP - 25

EP - 36

JO - North-Holland Mathematics Studies

JF - North-Holland Mathematics Studies

SN - 0304-0208

IS - C

ER -