Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
From MaRDI portal
Publication:5351870
DOI10.1137/16M1055189zbMath1370.05069OpenAlexW2751410871MaRDI QIDQ5351870
Jiaao Li, Rong Luo, Hong-Jian Lai
Publication date: 31 August 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1055189
group connectivitymodulo orientationnowhere-zero flowgraphic sequence realizationstrongly \(\mathbb Z_m\)-connectivity
Related Items
Eulerian subgraphs and \(S\)-connectivity of graphs, Group connectivity under 3‐edge‐connectivity, Mod $(2p+1)$-Orientation on Bipartite Graphs and Complementary Graphs, On weighted modulo orientation of graphs, Homomorphisms to small negative even cycles, Bigraphic pairs with an \(A\)-connected realization, The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization, Modulo 5-orientations and degree sequences, Circular Flows in Planar Graphs, Group connectivity and group coloring: small groups versus large groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs
- A note on an extremal problem for group-connectivity
- The weak 3-flow conjecture and the weak circular flow conjecture
- An extremal problem on group connectivity of graphs
- Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Graphic sequences with an \(A\)-connected realization
- A complete characterization of graphic sequences with a \(Z_3\)-connected realization
- Degree conditions for group connectivity
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Group connectivity of 3-edge-connected chordal graphs
- Group connectivity and group colorings of graphs --- a survey
- Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Mod (2p + 1)-Orientations and $K_{1,2p+1}$-Decompositions
- Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
- Optimal attack and reinforcement of a network
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Line removal algorithms for graphs and their degree lists
- Nowhere‐zero 3‐flows in locally connected graphs
- Decomposition of Finite Graphs Into Forests
- A Contribution to the Theory of Chromatic Polynomials
- Research problems
