A note on an extremal problem for group-connectivity

DOI10.1016/j.ejc.2014.03.002zbMath1297.05137OpenAlexW2006126670MaRDI QIDQ402471

Rong Luo, Cun-Quan Zhang, Dong Ye, Ye-Zhou Wu

Publication date: 28 August 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2014.03.002

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Related Items (5)

Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees ⋮ Bigraphic pairs with an \(A\)-connected realization ⋮ The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization ⋮ A complete characterization of graphic sequences with a \(Z_3\)-connected realization ⋮ Modulo 5-orientations and degree sequences

Cites Work

• The weak 3-flow conjecture and the weak circular flow conjecture
• An extremal problem on group connectivity of graphs
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Degree sum condition for \(Z_{3}\)-connectivity in graphs
• 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
• Group connectivity and group colorings of graphs --- a survey
• Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
• Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
• A Contribution to the Theory of Chromatic Polynomials
• Research problems
• Unnamed Item

This page was built for publication: A note on an extremal problem for group-connectivity