An extremal problem on group connectivity of graphs
From MaRDI portal
Publication:427794
DOI10.1016/J.EJC.2012.01.003zbMath1242.05133OpenAlexW2045191011MaRDI QIDQ427794
Publication date: 18 June 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2012.01.003
Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)
Related Items (10)
An extremal problem on bigraphic pairs with an \(A\)-connected realization ⋮ Two equivalent properties of \(\mathcal Z_3\)-connectivity ⋮ Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization ⋮ Realizing degree sequences as \(Z_3\)-connected graphs ⋮ A note on an extremal problem for group-connectivity ⋮ 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 ⋮ Graphic sequences with an \(A\)-connected realization ⋮ A complete characterization of graphic sequences with a \(Z_3\)-connected realization
Cites Work
- Unnamed Item
- Unnamed Item
- Degree sum condition for \(Z_{3}\)-connectivity in graphs
- Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
- Group connectivity of graphs with diameter at most 2
- Ore-condition and \(Z_3\)-connectivity
- Nowhere-zero 3-flows in triangularly connected graphs
- On group connectivity of graphs
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Group connectivity of 3-edge-connected chordal graphs
- Algorithms for constructing graphs and digraphs with given valences and factors
- Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
- Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- A Contribution to the Theory of Chromatic Polynomials
- Research problems
This page was built for publication: An extremal problem on group connectivity of graphs
