On the number of cycles of lengthk in a maximal planar graph

DOI10.1002/jgt.3190030108zbMath0395.05046OpenAlexW2098281668MaRDI QIDQ4177606

S. Louis Hakimi, Edward F. Schmeichel

Publication date: 1979

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190030108

zbMATH Keywords

Maximal Planar GraphNumber of Cycles of Length K

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (26)

Path partitioning planar graphs of girth 4 without adjacent short cycles ⋮ Subgraph densities in a surface ⋮ On the frequency of 3-connected subgraphs of planar graphs ⋮ Tree densities in sparse graph classes ⋮ Cliques in graphs excluding a complete graph minor ⋮ The maximum number of paths of length four in a planar graph ⋮ 2-spanning cyclability problems of some generalized Petersen graphs ⋮ Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators ⋮ Generalized planar Turán numbers ⋮ The maximum number of paths of length three in a planar graph ⋮ Counting paths, cycles, and blow‐ups in planar graphs ⋮ The maximum number of induced C5's in a planar graph ⋮ The minimum number of 4-cycles in a maximal planar graph with small number of vertices ⋮ Planar graphs with the maximum number of induced 6-cycles ⋮ On k-path Hamiltonian maximal planar graphs ⋮ Bounds on the number of cycles of length three in a planar graph ⋮ Disjoint cycles in hypercubes with prescribed vertices in each cycle ⋮ The number of $4$-cycles and the cyclomatic number of a finite simple graph ⋮ Path partitioning planar graphs with restrictions on short cycles ⋮ On the number of hamiltonian cycles in a maximal planar graph ⋮ Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees ⋮ Structure and pancyclicity of maximal planar graphs with diameter two ⋮ Generalized outerplanar Turán number of short paths ⋮ The maximum number of 10- and 12-cycles in a planar graph ⋮ Floorplanning by graph dualization: \(L\)-shaped modules ⋮ Counting cliques in 1-planar graphs

Cites Work

• The Use of S-Functions in Combinatorial Analysis
• Unnamed Item

This page was built for publication: On the number of cycles of lengthk in a maximal planar graph