On the frequency of 3-connected subgraphs of planar graphs
From MaRDI portal
Publication:3708823
DOI10.1017/S0004972700010182zbMath0584.05030MaRDI QIDQ3708823
Publication date: 1986
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (6)
Subgraph densities in a surface ⋮ Tree densities in sparse graph classes ⋮ Generalized planar Turán numbers ⋮ The maximum number of paths of length three in a planar graph ⋮ Planar graphs with the maximum number of induced 6-cycles ⋮ Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees
Cites Work
This page was built for publication: On the frequency of 3-connected subgraphs of planar graphs