AbstractIn this paper we prove: (i) If a graph G has a nowhere-zero 6-flow φ such that | Eodd (φ)| ≥ 23 |E(G)|, then G has a cycle cover in which the sum of the lengths of the cycles in the cycle cover is at most 4427 |E(G)|, where Eodd (φ) = {e ∈ E(G) : is odd}; (ii) if Tutte′s 3-Flow Conjecture is true, then every bridgeless graph G has a nowhere-zero 6-flow φ such that | Eodd (φ)| ≥ 23 | E(G)|
AbstractLet G be a graph with odd edge-connectivity r. It is proved in this paper that if r>3, then ...
The aim of this thesis is to show and put together the results, obtained so far, useful to tackle a ...
AbstractLet G be a simple graph on n vertices. In this paper, we prove that if G satisfies the condi...
AbstractIn this paper we prove: (i) If a graph G has a nowhere-zero 6-flow φ such that | Eodd (φ)| ≥...
AbstractResults related to integer flows and cycle covers are presented. A cycle cover of a graph G ...
The Shortest Cycle Cover Conjecture of Alon and Tarsi asserts that the edges of every bridgeless gra...
AbstractResults related to integer flows and cycle covers are presented. A cycle cover of a graph G ...
AbstractIn 1954, Tutte conjectured that every bridgeless graph has a nowhere-zero 5-flow. Let ω(G) b...
AbstractThe odd-edge-connectivity of a graph G is the size of the smallest odd edge cut of G. Tutte ...
AbstractThe assertion of the long standing cycle double cover conjecture is shown to be true if eith...
AbstractThe 3-flow conjecture of Tutte is that every bridgeless graph without a 3-edge cut has a now...
AbstractIt was conjectured by Fulkerson that the edge-set of any bridgeless graph can be covered by ...
AbstractIt was conjectured by Fulkerson that the edge-set of any bridgeless graph can be covered by ...
We say that a~graph admits a~nowhere-zero k-flow if we can assign a~direction and a~positive integer...
We say that a~graph admits a~nowhere-zero k-flow if we can assign a~direction and a~positive integer...
AbstractLet G be a graph with odd edge-connectivity r. It is proved in this paper that if r>3, then ...
The aim of this thesis is to show and put together the results, obtained so far, useful to tackle a ...
AbstractLet G be a simple graph on n vertices. In this paper, we prove that if G satisfies the condi...
AbstractIn this paper we prove: (i) If a graph G has a nowhere-zero 6-flow φ such that | Eodd (φ)| ≥...
AbstractResults related to integer flows and cycle covers are presented. A cycle cover of a graph G ...
The Shortest Cycle Cover Conjecture of Alon and Tarsi asserts that the edges of every bridgeless gra...
AbstractResults related to integer flows and cycle covers are presented. A cycle cover of a graph G ...
AbstractIn 1954, Tutte conjectured that every bridgeless graph has a nowhere-zero 5-flow. Let ω(G) b...
AbstractThe odd-edge-connectivity of a graph G is the size of the smallest odd edge cut of G. Tutte ...
AbstractThe assertion of the long standing cycle double cover conjecture is shown to be true if eith...
AbstractThe 3-flow conjecture of Tutte is that every bridgeless graph without a 3-edge cut has a now...
AbstractIt was conjectured by Fulkerson that the edge-set of any bridgeless graph can be covered by ...
AbstractIt was conjectured by Fulkerson that the edge-set of any bridgeless graph can be covered by ...
We say that a~graph admits a~nowhere-zero k-flow if we can assign a~direction and a~positive integer...
We say that a~graph admits a~nowhere-zero k-flow if we can assign a~direction and a~positive integer...
AbstractLet G be a graph with odd edge-connectivity r. It is proved in this paper that if r>3, then ...
The aim of this thesis is to show and put together the results, obtained so far, useful to tackle a ...
AbstractLet G be a simple graph on n vertices. In this paper, we prove that if G satisfies the condi...
DOI
Add to ORKG