Results 1 
5 of
5
Minimal Cycle Bases of Outerplanar Graphs
, 1998
"... 2connected outerplanar graphs have a unique minimal cycle basis with length 2jEj \Gamma jV j. They are the only Hamiltonian graphs with a cycle basis of this length. Keywords: Minimal Cycle Basis, Outerplanar Graphs AMS Subject Classification: Primary 05C38. Secondary 92D20. The electronic journa ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
2connected outerplanar graphs have a unique minimal cycle basis with length 2jEj \Gamma jV j. They are the only Hamiltonian graphs with a cycle basis of this length. Keywords: Minimal Cycle Basis, Outerplanar Graphs AMS Subject Classification: Primary 05C38. Secondary 92D20. The electronic journal of combinatorics 5 (1998), #R16 2 1. Introduction The description of cyclic structures is an important problem in graph theory (see e.g. [16]). Cycle bases of graphs have a variety of applications in science and engineering, among them in structural analysis [11] and in chemical structure storage and retrieval systems [7]. Naturally, minimal cycles bases are of particular practical interest. In this contribution we prove that outerplanar graphs have a unique minimal cycle basis. This result was motivated by the analysis of the structures of biopolymers. In addition we derive upper and lower bounds on the length of minimal cycle basis in 2connected graphs. Biopolymers, such as RNA, DNA,...
Elimination of local bridges
 Math. Slovaca
, 1997
"... Let K be a subgraph of G. It is shown that if G is 3–connected modulo K then it is possible to replace branches of K by other branches joining same pairs of main vertices of K such that G has no local bridges with respect to the new subgraph K. A linear time algorithm is presented that either perfor ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
Let K be a subgraph of G. It is shown that if G is 3–connected modulo K then it is possible to replace branches of K by other branches joining same pairs of main vertices of K such that G has no local bridges with respect to the new subgraph K. A linear time algorithm is presented that either performs such a task, or finds a Kuratowski subgraph K5 or K3,3 in a subgraph of G formed by a branch e and local bridges on e. This result is needed in linear time algorithms for embedding graphs in surfaces.
Relevant Cycles in Biopolymers and Random Graphs
 Presented at the Fourth Slovene International Conference in Graph Theory
, 1999
"... 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 ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
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 bookembeddable graphs. Key words: Minimal Cycle Basis, Relevant Cycles, Essential Cycles, Biopolymer Graphs. Subject Classification: 05C38, 05C85. 1 Introduction Organic carbon compounds, such as the example shown in Figure 1, may exhibit elaborate polycyclic structures. Biopolymers, such as RNA, DNA, or proteins form welldefined three dimensional structures which are of utmost importance for their biological function. The most sali...
Base exchange properties of graphic matroids
, 1996
"... New base exchange properties of binary and graphic matroids are derived. The graphic matroids within the class of 4connected binary matroids are characterized by base exchange properties. Some progress with the characterization of arbitrary graphic matroids is made. Characterizing various types of ..."
Abstract
 Add to MetaCart
New base exchange properties of binary and graphic matroids are derived. The graphic matroids within the class of 4connected binary matroids are characterized by base exchange properties. Some progress with the characterization of arbitrary graphic matroids is made. Characterizing various types of matroids by base exchange properties is e.g. important in invariant theory.