Skip to main content Accessibility help
×
Home
Hostname: page-component-5d6d958fb5-mt5cb Total loading time: 0.376 Render date: 2022-11-29T17:37:20.419Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "displayNetworkTab": true, "displayNetworkMapGraph": false, "useSa": true } hasContentIssue true

On the Number of Simple Cycles in Planar Graphs

Published online by Cambridge University Press:  01 September 1999

HELMUT ALT
Affiliation:
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/inst/ag-ti
KLAUS KRIEGEL
Affiliation:
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/inst/ag-ti

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.

Type
Research Article
Copyright
1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)
6
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

On the Number of Simple Cycles in Planar Graphs
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

On the Number of Simple Cycles in Planar Graphs
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

On the Number of Simple Cycles in Planar Graphs
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *