On the frequency of 3-connected subgraphs of planar graphs

DOI10.1017/S0004972700010182zbMath0584.05030MaRDI QIDQ3708823

Nicholas C. Wormald

Publication date: 1986

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

planarityisomorphic subgraphs

Mathematics Subject Classification ID

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

• On the number of cycles of lengthk in a maximal planar graph
• Congruent Graphs and the Connectivity of Graphs

This page was built for publication: On the frequency of 3-connected subgraphs of planar graphs