Group connectivity in line graphs
From MaRDI portal
Publication:641209
DOI10.1016/j.disc.2011.07.017zbMath1231.05118OpenAlexW2131724264MaRDI QIDQ641209
Senmei Yao, Hao Li, Ping Li, Hong-Jian Lai, Yanting Liang
Publication date: 21 October 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.07.017
Applications of graph theory (05C90) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76) Flows in graphs (05C21)
Related Items (3)
Nowhere-zero flows on signed wheels and signed fans ⋮ 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs ⋮ Group connectivity in \(J_3\) line graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nowhere-zero 3-flows in triangularly connected graphs
- Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected
- On mod \((2p+1)\)-orientations of graphs
- On group connectivity of graphs
- Flows and generalized coloring theorems in graphs
- Nowhere-zero 6-flows
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Nowhere-zero 3-flows of highly connected graphs
- On a closure concept in claw-free graphs
- Group connectivity of 3-edge-connected chordal graphs
- Nowhere-zero flows in random graphs
- An equivalent version of the 3-flow conjecture
- Nowhere-zero 3-flows in squares of graphs
- Nowhere‐zero 3‐flows in locally connected graphs
- On the algebraic theory of graph colorings
- A Contribution to the Theory of Chromatic Polynomials
- Nowhere zero flows in line graphs
This page was built for publication: Group connectivity in line graphs
