Maximum degree condition and group connectivity

DOI10.1007/s00373-013-1315-yzbMath1298.05187OpenAlexW2075365590MaRDI QIDQ742616

Xiangwen Li, Xiaoxia Zhang

Publication date: 19 September 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1315-y

zbMATH Keywords

group connectivitynowhere-zero flowsdegree condition

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degree sum condition for \(Z_{3}\)-connectivity in graphs
• Group connectivity of graphs with diameter at most 2
• Ore-condition and \(Z_3\)-connectivity
• Degree conditions for group connectivity
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group connectivity of 3-edge-connected chordal graphs
• Group connectivity in 3-edge-connected graphs
• Group connectivity and group colorings of graphs --- a survey
• Ore Condition and Nowhere-Zero 3-Flows
• Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
• On the algebraic theory of graph colorings
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Maximum degree condition and group connectivity