Let 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]
Consider a graph G on n vertices with α (n 2) edges which does not contain an induced K2,t (t ⩾ 2). ...
Consider a graph G on n vertices with αn 2 edges which does not contain an induced K2,t (t > 2). How...
There are many major open problems in integer flow theory, such as Tutte’s 3-flow conjecture that ev...
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)+...
AbstractLet G be a 2-edge-connected simple graph on n⩾24 vertices containng no Km+1. Of |E(G)|⩾(n - ...
AbstractLet G be a 2-edge-connected simple graph on n⩾24 vertices containng no Km+1. Of |E(G)|⩾(n - ...
Tutte [45] conjectured that every bridgeless Petersen-minor free graph admits a nowhere-zero 4-flow....
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Let F12 be...
AbstractThe odd-edge-connectivity of a graph G is the size of the smallest odd edge cut of G. Tutte ...
AbstractIn this paper, we obtained some necessary and sufficient conditions for a graph having 5-, 6...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Jaeger et ...
We show that every bridgeless cubic graph without a Petersen minor has a nowhere-zero 5-flow. This a...
summary:Let $G$ be a graph, and $\lambda $ the smallest integer for which $G$ has a nowhere-zero $\l...
summary:Let $G$ be a graph, and $\lambda $ the smallest integer for which $G$ has a nowhere-zero $\l...
Consider a graph G on n vertices with α (n 2) edges which does not contain an induced K2,t (t ⩾ 2). ...
Consider a graph G on n vertices with αn 2 edges which does not contain an induced K2,t (t > 2). How...
There are many major open problems in integer flow theory, such as Tutte’s 3-flow conjecture that ev...
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)+...
AbstractLet G be a 2-edge-connected simple graph on n⩾24 vertices containng no Km+1. Of |E(G)|⩾(n - ...
AbstractLet G be a 2-edge-connected simple graph on n⩾24 vertices containng no Km+1. Of |E(G)|⩾(n - ...
Tutte [45] conjectured that every bridgeless Petersen-minor free graph admits a nowhere-zero 4-flow....
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Let F12 be...
AbstractThe odd-edge-connectivity of a graph G is the size of the smallest odd edge cut of G. Tutte ...
AbstractIn this paper, we obtained some necessary and sufficient conditions for a graph having 5-, 6...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Jaeger et ...
We show that every bridgeless cubic graph without a Petersen minor has a nowhere-zero 5-flow. This a...
summary:Let $G$ be a graph, and $\lambda $ the smallest integer for which $G$ has a nowhere-zero $\l...
summary:Let $G$ be a graph, and $\lambda $ the smallest integer for which $G$ has a nowhere-zero $\l...
Consider a graph G on n vertices with α (n 2) edges which does not contain an induced K2,t (t ⩾ 2). ...
Consider a graph G on n vertices with αn 2 edges which does not contain an induced K2,t (t > 2). How...
There are many major open problems in integer flow theory, such as Tutte’s 3-flow conjecture that ev...