Degree conditions for group connectivity
From MaRDI portal
Publication:966042
DOI10.1016/j.disc.2009.10.023zbMath1231.05160MaRDI 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
05C40: Connectivity
Related Items
Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees, Group connectivity of bridged graphs, Degree sum of 3 independent vertices and \(Z_3\)-connectivity, Degree condition and \(Z_3\)-connectivity, Degree sequences and graphs with disjoint spanning trees, Maximum degree condition and group connectivity, Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs, Packing spanning trees in highly essentially connected graphs, Group connectivity in 3-edge-connected graphs, The Chvátal-Erdős condition for group connectivity in graphs, Complete family reduction and spanning connectivity in line graphs, Chvátal-Erdős conditions and almost spanning trails, Complementary graphs with flows less than three, Group connectivity and matchings, Group connectivity and group colorings of graphs --- a survey, Neighborhood unions and \(Z_3\)-connectivity in graphs, EVERY N2-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z3-CONNECTED
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
