Group connectivity of graphs: a nonhomogeneous analogue of nowhere-zero flow properties
Journal of Combinatorial Theory Series B
Graph Theory With Applications
Graph Theory With Applications
Ore Condition and Nowhere-Zero 3-Flows
SIAM Journal on Discrete Mathematics
On Group Connectivity of Graphs
Graphs and Combinatorics
An extremal problem on group connectivity of graphs
European Journal of Combinatorics
The smallest degree sum that yields graphic sequences with a Z3-connected realization
European Journal of Combinatorics
Contractible configurations on 3-flows in graphs satisfying the Fan-condition
European Journal of Combinatorics
Nowhere-zero 3-flows and modulo k-orientations
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
Let 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.