On the Number of Simple Cycles in Planar Graphs
From MaRDI portal
Publication:4934778
DOI10.1017/S0963548399003995zbMath0936.05062OpenAlexW2020839092MaRDI QIDQ4934778
Helmut Alt, Klaus Kriegel, U. Fuchs
Publication date: 8 May 2000
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548399003995
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Related Items (5)
Triangle-free graphs with the maximum number of cycles ⋮ Bounding the number of cycles in a graph in terms of its degree sequence ⋮ On the maximum number of cycles in outerplanar and series-parallel graphs ⋮ The maximum number of cycles in a graph with fixed number of edges ⋮ On the maximum number of cycles in outerplanar and series-parallel graphs
This page was built for publication: On the Number of Simple Cycles in Planar Graphs