DOIAbstract
AbstractLet G be a simple graph satisfying the Ore-condition with |V(G)|≥3. In this paper, we prove that G is A-connected for any abelian group A with |A|≥3 if and only if G is not one of the 12 completely described graphs
AbstractLet G be a simple graph satisfying the Ore-condition with |V(G)|≥3. In this paper, we prove that G is A-connected for any abelian group A with |A|≥3 if and only if G is not one of the 12 completely described graphs
AbstractWe prove that every line graph of a 4-edge-connected graph is Z3-connected. In particular, e...
Tutte introduced the theory of nowhere-zero flows and showed that a plane graph G has a face k-color...
Let G be an undirected graph, A be an (additive) abelian group and A* = A - {lcub}0{rcub}. A graph G...
AbstractLet G be a simple graph satisfying the Ore-condition with |V(G)|≥3. In this paper, we prove ...
AbstractLet G be a 2-edge-connected simple graph on n≥3 vertices and A an abelian group with |A|≥3. ...
AbstractLet G be a 2-edge-connected simple graph on n≥13 vertices and A an (additive) abelian group ...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Jaeger et ...
AbstractLet A be an Abelian group, n≥3 be an integer, and ex(n,A) be the maximum integer such that e...
AbstractLet G be a 2-edge-connected simple graph on n≥3 vertices and A an abelian group with |A|≥3. ...
AbstractLet G = (V, E) be a digraph and f a mapping from E into an Abelian group A. Associated with ...
AbstractA graph G is k-triangular if each edge of G is in at least k triangles. It is conjectured th...
Let A be an Abelian group, n \u3e 3 be an integer, and ex(n, A) be the maximum integer such that eve...
Let A be an Abelian group, n \u3e 3 be an integer, and ex(n, A) be the maximum integer such that eve...
Let A be an Abelian group, n?3 be an integer, and ex(n,A) be the maximum integer such that every n-v...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Let F12 be...
AbstractWe prove that every line graph of a 4-edge-connected graph is Z3-connected. In particular, e...
Tutte introduced the theory of nowhere-zero flows and showed that a plane graph G has a face k-color...
Let G be an undirected graph, A be an (additive) abelian group and A* = A - {lcub}0{rcub}. A graph G...
AbstractLet G be a simple graph satisfying the Ore-condition with |V(G)|≥3. In this paper, we prove ...
AbstractLet G be a 2-edge-connected simple graph on n≥3 vertices and A an abelian group with |A|≥3. ...
AbstractLet G be a 2-edge-connected simple graph on n≥13 vertices and A an (additive) abelian group ...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Jaeger et ...
AbstractLet A be an Abelian group, n≥3 be an integer, and ex(n,A) be the maximum integer such that e...
AbstractLet G be a 2-edge-connected simple graph on n≥3 vertices and A an abelian group with |A|≥3. ...
AbstractLet G = (V, E) be a digraph and f a mapping from E into an Abelian group A. Associated with ...
AbstractA graph G is k-triangular if each edge of G is in at least k triangles. It is conjectured th...
Let A be an Abelian group, n \u3e 3 be an integer, and ex(n, A) be the maximum integer such that eve...
Let A be an Abelian group, n \u3e 3 be an integer, and ex(n, A) be the maximum integer such that eve...
Let A be an Abelian group, n?3 be an integer, and ex(n,A) be the maximum integer such that every n-v...
AbstractTutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. Let F12 be...
AbstractWe prove that every line graph of a 4-edge-connected graph is Z3-connected. In particular, e...
Tutte introduced the theory of nowhere-zero flows and showed that a plane graph G has a face k-color...
Let G be an undirected graph, A be an (additive) abelian group and A* = A - {lcub}0{rcub}. A graph G...
Add to ORKG