Relevant Cycles in Biopolymers and Random Graphs
Short cycles are an important characteristic of molecular graphs in organic chemistry as well as in structural biology. Minimum cycle bases are of particular interest, despite the fact that they are usually not unique. Hence, one sometimes resorts to the set relevant cycles, defined as the union of all minimum cycles bases. Here we introduce the set of essential cycles as the intersection of a graph's minimum cycle bases and provide an algorithm for their computation. Furthermore, we extend previous bounds on the length of minimal cycles bases to certain book-embeddable graphs. Submitted to Fourth Slovene International Conference in Graph Theory
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||Jul 1999|
|Date of revision:|
|Contact details of provider:|| Postal: 1399 Hyde Park Road, Santa Fe, New Mexico 87501|
Web page: http://www.santafe.edu/sfi/publications/working-papers.html
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:99-07-042. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.