On the Number of Cycles in Planar Graphs

DOI10.1007/978-3-540-73545-8_12zbMath1206.05055OpenAlexW2161968825MaRDI QIDQ3608835

Klaus Kriegel, Christian Knauer, Raimund Seidel, André Schulz, Kevin Buchin

Publication date: 6 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_12

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (11)

Counting carambolas ⋮ Convex Polygons in Geometric Triangulations ⋮ Convex Polygons in Geometric Triangulations ⋮ An upper bound for the number of rectangulations of a planar point set ⋮ Triangle-free graphs with the maximum number of cycles ⋮ Disjoint compatible geometric matchings ⋮ Cycle-maximal triangle-free graphs ⋮ 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 ⋮ Monotone paths in geometric triangulations ⋮ On the maximum number of cycles in outerplanar and series-parallel graphs

This page was built for publication: On the Number of Cycles in Planar Graphs