Minimal cycle bases of outerplanar graphs.
Interchangeability of relevant cycles in graphs.
Nodal domain theorems and bipartite subgraphs.
A prime factor theorem for a generalized direct product
We introduce the concept of neighborhood systems as a generalization of directed, reflexive graphs and show that the prime factorization of neighborhood systems with respect to the the direct product is unique under the condition that they satisfy an appropriate notion of thinness.
Circuit bases of strongly connected digraphs
The cycle space of a strongly connected graph has a basis consisting of directed circuits. The concept of relevant circuits is introduced as a generalization of the relevant cycles in undirected graphs. A polynomial time algorithm for the computation of a minimum weight directed circuit basis is outlined.
Page 1