Let G be a 2-connected graph with minimum degree d I. Hartman proved that the cycles of length at least d + 1 generate the cycle space of G, unless d is odd and G ≅ Kd+1. We give a new and simpler proof of this theorem
AbstractS. Locke proved that the cycle space of a 3-connected nonhamiltonian graph with minimum degr...
AbstractA basis of the cycle space C(G) of a graph G is h-fold if each edge of G occurs in at most h...
Abstract: In this paper, we study the minimum cycle base of the planar graphs obtained from two 2-co...
Let G be a 2-connected graph with minimum degree d I. Hartman proved that the cycles of length at le...
AbstractLet G be a 2-connected graph in which the degree of every vertex is at least d. We prove tha...
AbstractLet G be a 2-connected graph in which the degree of every vertex is at least d. We prove tha...
AbstractS. Locke proved that the cycle space of a 3-connected nonhamiltonian graph with minimum degr...
AbstractLet G = (V, E) be a graph with arbitrary (perturbed) edge weights and let C(e) denote the sh...
AbstractLet G = (V, E) be a graph with arbitrary (perturbed) edge weights and let C(e) denote the sh...
We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n ...
AbstractIn this paper we investigate cycle base structures of a 2-(edge)-connected graph on surfaces...
We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n v...
We consider the problem of computing a minimum cycle basis of an undirected edge-weighted graph G wi...
We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n v...
The perception of cyclic structures is a crucial step in the analysis of graphs. To describe the cyc...
AbstractS. Locke proved that the cycle space of a 3-connected nonhamiltonian graph with minimum degr...
AbstractA basis of the cycle space C(G) of a graph G is h-fold if each edge of G occurs in at most h...
Abstract: In this paper, we study the minimum cycle base of the planar graphs obtained from two 2-co...
Let G be a 2-connected graph with minimum degree d I. Hartman proved that the cycles of length at le...
AbstractLet G be a 2-connected graph in which the degree of every vertex is at least d. We prove tha...
AbstractLet G be a 2-connected graph in which the degree of every vertex is at least d. We prove tha...
AbstractS. Locke proved that the cycle space of a 3-connected nonhamiltonian graph with minimum degr...
AbstractLet G = (V, E) be a graph with arbitrary (perturbed) edge weights and let C(e) denote the sh...
AbstractLet G = (V, E) be a graph with arbitrary (perturbed) edge weights and let C(e) denote the sh...
We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n ...
AbstractIn this paper we investigate cycle base structures of a 2-(edge)-connected graph on surfaces...
We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n v...
We consider the problem of computing a minimum cycle basis of an undirected edge-weighted graph G wi...
We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n v...
The perception of cyclic structures is a crucial step in the analysis of graphs. To describe the cyc...
AbstractS. Locke proved that the cycle space of a 3-connected nonhamiltonian graph with minimum degr...
AbstractA basis of the cycle space C(G) of a graph G is h-fold if each edge of G occurs in at most h...
Abstract: In this paper, we study the minimum cycle base of the planar graphs obtained from two 2-co...
DOI
Add to ORKG