Publication date
December 1992
DOI Publisher
Published by Elsevier B.V. ISSN
0012-365XAbstract
AbstractLet G be a k-edge-connected graph of order n. If k⩾4⌈log2 n⌉ then G has a nowhere-zero 3-flow
AbstractLet G be a k-edge-connected graph of order n. If k⩾4⌈log2 n⌉ then G has a nowhere-zero 3-flow
AbstractThe odd-edge-connectivity of a graph G is the size of the smallest odd edge cut of G. Tutte ...
In this lecture, we establish the connection between nowhere-zero k-flows and nowhere-zero Zk-flows....
AbstractThe 3-flow conjecture of Tutte is that every bridgeless graph without a 3-edge cut has a now...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Jaeger et ...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Let F12 be...
It was conjectured by Tutte that every 4-edge-connected graph admits a nowhere-zero $3$-flow. In thi...
AbstractThe 3-flow conjecture of Tutte is that every bridgeless graph without a 3-edge cut has a now...
There are many major open problems in integer flow theory, such as Tutte’s 3-flow conjecture that ev...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Jaeger et ...
AbstractThe odd-edge-connectivity of a graph G is the size of the smallest odd edge cut of G. Tutte ...
AbstractLet H1 and H2 be two subgraphs of a graph G. We say that G is the 2-sum of H1 and H2, denote...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Let F12 be...
AbstractA nowhere-zero 3-flow in a graph G is an assignment of a direction and a value of 1 or 2 to ...
AbstractWe prove that every graph with no isthmus has a nowhere-zero 6-flow, that is, a circulation ...
In 1972, Tutte posed the 3-Flow Conjecture: that all 4-edge-connected graphs have a nowhere zero 3-f...
AbstractThe odd-edge-connectivity of a graph G is the size of the smallest odd edge cut of G. Tutte ...
In this lecture, we establish the connection between nowhere-zero k-flows and nowhere-zero Zk-flows....
AbstractThe 3-flow conjecture of Tutte is that every bridgeless graph without a 3-edge cut has a now...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Jaeger et ...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Let F12 be...
It was conjectured by Tutte that every 4-edge-connected graph admits a nowhere-zero $3$-flow. In thi...
AbstractThe 3-flow conjecture of Tutte is that every bridgeless graph without a 3-edge cut has a now...
There are many major open problems in integer flow theory, such as Tutte’s 3-flow conjecture that ev...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Jaeger et ...
AbstractThe odd-edge-connectivity of a graph G is the size of the smallest odd edge cut of G. Tutte ...
AbstractLet H1 and H2 be two subgraphs of a graph G. We say that G is the 2-sum of H1 and H2, denote...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Let F12 be...
AbstractA nowhere-zero 3-flow in a graph G is an assignment of a direction and a value of 1 or 2 to ...
AbstractWe prove that every graph with no isthmus has a nowhere-zero 6-flow, that is, a circulation ...
In 1972, Tutte posed the 3-Flow Conjecture: that all 4-edge-connected graphs have a nowhere zero 3-f...
AbstractThe odd-edge-connectivity of a graph G is the size of the smallest odd edge cut of G. Tutte ...
In this lecture, we establish the connection between nowhere-zero k-flows and nowhere-zero Zk-flows....
AbstractThe 3-flow conjecture of Tutte is that every bridgeless graph without a 3-edge cut has a now...
Add to ORKG