Bounds on the number of cycles of length three in a planar graph

DOI10.1007/BF02760664zbMath0484.05033MaRDI QIDQ1163566

S. Louis Hakimi, Edward F. Schmeichel

Publication date: 1982

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

planar graph with nontriangular faces

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

Subgraph densities in a surface ⋮ Tree densities in sparse graph classes

Cites Work

• The number of triangles in a triangulation of a set of points in the plane
• On Planar Graphical Degree Sequences
• On the number of cycles of lengthk in a maximal planar graph
• Non-Separable and Planar Graphs
• Polytopes, graphs, and complexes
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on the number of cycles of length three in a planar graph