On the Number of Cycles in Planar Graphs

DOI10.1007/978-3-540-73545-8_12MaRDI QIDQ3608835zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• scientific article; zbMATH DE number 1107718
• On the Number of Simple Cycles in Planar Graphs
• Hamiltonian Paths and Cycles in Planar Graphs
• On the maximum number of cycles in a planar graph
• Estimating the number of short cycles in a simple planar graph

Cited in

(32)

• On the maximum number of cycles in a planar graph
• Arithmetic progressions of cycles in outer-planar graphs
• Cycle lengths in planar graphs
• Planar anti-Ramsey numbers of paths and cycles
• scientific article; zbMATH DE number 4079454 (Why is no real title available?)
• scientific article; zbMATH DE number 4128839 (Why is no real title available?)
• Estimating the number of short cycles in a simple planar graph
• Counting carambolas
• On the planarity of cyclic graphs
• A direct method for calculating cell cycles of a block map of a simple planar graph
• Convex Polygons in Geometric Triangulations
• The number of circles of a maximum state of a plane graph with applications
• The Even Cycle Problem for Planar Digraphs
• On the Number of Simple Cycles in Planar Graphs
• On the component number of links from plane graphs
• Planar Turán numbers of cycles: a counterexample
• scientific article; zbMATH DE number 1107718 (Why is no real title available?)
• Disjoint compatible geometric matchings
• Bounding the number of cycles in a graph in terms of its degree sequence
• Cycles of Prescribed Modularity in Planar Digraphs
• Cycle-maximal triangle-free graphs
• Triangle-free graphs with the maximum number of cycles
• On the maximum number of cycles in outerplanar and series-parallel graphs
• Convex polygons in geometric triangulations
• Another Hamiltonian cycle in bipartite Pfaffian graphs
• scientific article; zbMATH DE number 4016941 (Why is no real title available?)
• Counting paths, cycles, and blow‐ups in planar graphs
• scientific article; zbMATH DE number 4055651 (Why is no real title available?)
• Hitting Weighted Even Cycles in Planar Graphs
• An upper bound for the number of rectangulations of a planar point set
• On the maximum number of cycles in outerplanar and series-parallel graphs
• scientific article; zbMATH DE number 4016932 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608835)