Group connectivity under 3‐edge‐connectivity
From MaRDI portal
Publication:6055402
DOI10.1002/jgt.22623zbMath1521.05060MaRDI QIDQ6055402
Miaomiao Han, MeiLing Wang, Jiaao Li, Xue Liang Li
Publication date: 29 September 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Connectivity (05C40) Flows in graphs (05C21)
Cites Work
- Unnamed Item
- The weak 3-flow conjecture and the weak circular flow conjecture
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Graphs without spanning closed trails
- Flows and generalized coloring theorems in graphs
- Nowhere-zero 6-flows
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Group connectivity of 3-edge-connected chordal graphs
- An equivalent version of the 3-flow conjecture
- Group connectivity and group colorings of graphs --- a survey
- Extending a partial nowhere-zero 4-flow
- Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees
- Group connectivity: Z4 vs Z22
- Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
- On the algebraic theory of graph colorings
- A Contribution to the Theory of Chromatic Polynomials