Group connectivity in 3-edge-connected graphs
From MaRDI portal
Publication:1926023
DOI10.1007/s00373-011-1067-5zbMath1256.05135MaRDI QIDQ1926023
Publication date: 27 December 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-011-1067-5
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Degree conditions for group connectivity
- The supereulerian graphs in the graph family \(C(l,k)\)
- Graphs without spanning closed trails
- Flows and generalized coloring theorems in graphs
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Group connectivity of 3-edge-connected chordal graphs
- A note on minimum degree conditions for supereulerian graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- A reduction method to find spanning Eulerian subgraphs
- Extending a partial nowhere-zero 4-flow
- On the algebraic theory of graph colorings
- Decomposition of Finite Graphs Into Forests
- A Contribution to the Theory of Chromatic Polynomials