AbstractLet G be a 2-edge-connected simple graph on n⩾24 vertices containng no Km+1. Of |E(G)|⩾(n - 17 - k2)+(m - l)(k + 12)+ 33, where ⌊n−17/m⌋, then either G has a nowhere-zero 4-flow, or G can be contracted to the Petersen graph. This is a generalization of a result in [4]
AbstractIn this article, we deal with a connectivity problem stated by Maurer and Slater to characte...
AbstractThe odd-edge-connectivity of a graph G is the size of the smallest odd edge cut of G. Tutte ...
AbstractWe show that a smallest counterexample to the 5-Flow Conjecture of Tutte (every bridgeless g...
AbstractLet G be a 2-edge-connected simple graph on n⩾24 vertices containng no Km+1. Of |E(G)|⩾(n - ...
Let G be a 2-edge-connected simple graph on n⩾24 vertices containng no Km+1. Of|E(G)|⩾(n - 17 - k2)+...
Let G be a 2-edge-connected simple graph on n⩾24 vertices containng no Km+1. Of|E(G)|⩾(n - 17 - k2)+...
Let G be a 2-edge-connected simple graph on n⩾24 vertices containng no Km+1. Of|E(G)|⩾(n - 17 - k2)+...
AbstractTutte [W.T. Tutte, On the algebraic theory of graph colorings, J. Combin. Theory 1 (1966) 15...
Tutte [45] conjectured that every bridgeless Petersen-minor free graph admits a nowhere-zero 4-flow....
AbstractIn this paper, we obtained some necessary and sufficient conditions for a graph having 5-, 6...
AbstractWe prove that every graph with no isthmus has a nowhere-zero 6-flow, that is, a circulation ...
AbstractLet G be a 2-edge-connected simple graph on n≥13 vertices and A an (additive) abelian group ...
AbstractIn 1954, Tutte conjectured that every bridgeless graph has a nowhere-zero 5-flow. Let ω(G) b...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Jaeger et ...
AbstractLet G be a 2-edge-connected simple graph on n≥3 vertices and A an abelian group with |A|≥3. ...
AbstractIn this article, we deal with a connectivity problem stated by Maurer and Slater to characte...
AbstractThe odd-edge-connectivity of a graph G is the size of the smallest odd edge cut of G. Tutte ...
AbstractWe show that a smallest counterexample to the 5-Flow Conjecture of Tutte (every bridgeless g...
AbstractLet G be a 2-edge-connected simple graph on n⩾24 vertices containng no Km+1. Of |E(G)|⩾(n - ...
Let G be a 2-edge-connected simple graph on n⩾24 vertices containng no Km+1. Of|E(G)|⩾(n - 17 - k2)+...
Let G be a 2-edge-connected simple graph on n⩾24 vertices containng no Km+1. Of|E(G)|⩾(n - 17 - k2)+...
Let G be a 2-edge-connected simple graph on n⩾24 vertices containng no Km+1. Of|E(G)|⩾(n - 17 - k2)+...
AbstractTutte [W.T. Tutte, On the algebraic theory of graph colorings, J. Combin. Theory 1 (1966) 15...
Tutte [45] conjectured that every bridgeless Petersen-minor free graph admits a nowhere-zero 4-flow....
AbstractIn this paper, we obtained some necessary and sufficient conditions for a graph having 5-, 6...
AbstractWe prove that every graph with no isthmus has a nowhere-zero 6-flow, that is, a circulation ...
AbstractLet G be a 2-edge-connected simple graph on n≥13 vertices and A an (additive) abelian group ...
AbstractIn 1954, Tutte conjectured that every bridgeless graph has a nowhere-zero 5-flow. Let ω(G) b...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Jaeger et ...
AbstractLet G be a 2-edge-connected simple graph on n≥3 vertices and A an abelian group with |A|≥3. ...
AbstractIn this article, we deal with a connectivity problem stated by Maurer and Slater to characte...
AbstractThe odd-edge-connectivity of a graph G is the size of the smallest odd edge cut of G. Tutte ...
AbstractWe show that a smallest counterexample to the 5-Flow Conjecture of Tutte (every bridgeless g...
DOI
Add to ORKG