Group connectivity in 3-edge-connected graphs

DOI10.1007/s00373-011-1067-5zbMath1256.05135OpenAlexW1978975094MaRDI QIDQ1926023

Fan Yang, Xiangwen Li

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

zbMATH Keywords

super-Eulerian graphsgroup connectivitynowhere-zero flows

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Related Items

Maximum degree condition and group connectivity, Group connectivity and matchings

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item