On the Number of Simple Cycles in Planar Graphs

Authors:
Helmut Alt;Ulrich Fuchs;Klaus Kriegel
Affiliations:
Institut für Informatik, Freie Universität Berlin, Takustr. 9, D-14195 Berlin, Germany (e-mail: alt@inf.fu-berlin.de kriegel@inf.fu-berlin.de) http://www.inf.fu-berlin.de&# ...;Our colleague Ulrich Fuchs died in a tragic accident on 19 September 1998.;Institut für Informatik, Freie Universität Berlin, Takustr. 9, D-14195 Berlin, Germany (e-mail: alt@inf.fu-berlin.de kriegel@inf.fu-berlin.de) http://www.inf.fu-berlin.de&# ...
Venue:
Combinatorics, Probability and Computing
Year:
1999

Citing 1
Cited 3

Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms

Cyclic pattern kernels for predictive graph mining

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
On the number of crossing-free matchings, (cycles, and partitions)

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the number of cycles in planar graphs

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let C(G) denote the number of simple cycles of a graph G and let C(n) be the maximum of C(G) over all planar graphs with n nodes. We present a lower bound on C(n), constructing graphs with at least 2.28n cycles. Applying some probabilistic arguments we prove an upper bound of 3.37n.We also discuss this question restricted to the subclasses of grid graphs, bipartite graphs, and 3-colourable triangulated graphs.