Group connectivity in \(J_3\) line graphs
From MaRDI portal
Publication:2354617
DOI10.1007/s00373-014-1418-0zbMath1317.05168OpenAlexW2091741249MaRDI QIDQ2354617
Publication date: 20 July 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1418-0
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph operations (line graphs, products, etc.) (05C76) Flows in graphs (05C21)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The weak 3-flow conjecture and the weak circular flow conjecture
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Group connectivity in line graphs
- Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
- Nowhere-zero 3-flows in triangularly connected graphs
- Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected
- On group connectivity of graphs
- 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
- Nowhere-zero 3-flows in squares of graphs
- On the algebraic theory of graph colorings
- A Contribution to the Theory of Chromatic Polynomials
- Nowhere zero flows in line graphs