Degree conditions for group connectivity

DOI10.1016/J.DISC.2009.10.023zbMath1231.05160OpenAlexW2137994050MaRDI QIDQ966042

Xiangwen Li, Hong-Jian Lai, Xiangjuan Yao

Publication date: 27 April 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.10.023

zbMATH Keywords

abelian groupgroup connectivity\(A\)-connected

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (17)

Packing spanning trees in highly essentially connected graphs ⋮ Neighborhood unions and \(Z_3\)-connectivity in graphs ⋮ Group connectivity of bridged graphs ⋮ Group connectivity in 3-edge-connected graphs ⋮ Degree sum of 3 independent vertices and \(Z_3\)-connectivity ⋮ Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees ⋮ Degree condition and \(Z_3\)-connectivity ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs ⋮ Chvátal-Erdős conditions and almost spanning trails ⋮ Degree sequences and graphs with disjoint spanning trees ⋮ The Chvátal-Erdős condition for group connectivity in graphs ⋮ Maximum degree condition and group connectivity ⋮ EVERY N₂-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z₃-CONNECTED ⋮ Complementary graphs with flows less than three ⋮ Complete family reduction and spanning connectivity in line graphs ⋮ Group connectivity and matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Group connectivity of graphs with diameter at most 2
• Ore-condition and \(Z_3\)-connectivity
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Group connectivity of 3-edge-connected chordal graphs
• A property on edge-disjoint spanning trees
• Ore Condition and Nowhere-Zero 3-Flows
• 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
• Graph family operations

This page was built for publication: Degree conditions for group connectivity