On the Number of Simple Cycles in Planar Graphs
1999 ◽
Vol 8
(5)
◽
pp. 397-405
◽
Keyword(s):
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.
Keyword(s):
Keyword(s):
1998 ◽
Vol 58
(1)
◽
pp. 1-13
◽
Keyword(s):
Limit Cycle Bifurcations for Piecewise Smooth Hamiltonian Systems with a Generalized Eye-Figure Loop
2016 ◽
Vol 26
(12)
◽
pp. 1650204
◽
Keyword(s):
1953 ◽
Vol 49
(1)
◽
pp. 59-62
◽
Keyword(s):
1965 ◽
Vol 12
(2)
◽
pp. 266-267
◽
Keyword(s):