On group connectivity of graphs
From MaRDI portal
Publication:1015425
DOI10.1007/s00373-008-0780-1zbMath1170.05042OpenAlexW2029318460MaRDI QIDQ1015425
Hong-Jian Lai, Ju Zhou, Rui Xu
Publication date: 8 May 2009
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-008-0780-1
Related Items (max. 100)
Two equivalent properties of \(\mathcal Z_3\)-connectivity ⋮ Spanning triangle-trees and flows of graphs ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ An extremal problem on group connectivity of graphs ⋮ A dual version of the brooks group coloring theorem ⋮ Group connectivity in line graphs ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ \(Z_3\)-connectivity of 4-edge-connected 2-triangular graphs ⋮ Group connectivity and matchings ⋮ Group connectivity in \(J_3\) line graphs
Cites Work
- Unnamed Item
- Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- An equivalent version of the 3-flow conjecture
- Nowhere-zero 3-flows in squares of graphs
- Nowhere‐zero 3‐flows in locally connected graphs
- A Contribution to the Theory of Chromatic Polynomials
This page was built for publication: On group connectivity of graphs
