Group connectivity of 3-edge-connected chordal graphs
From MaRDI portal
Publication:1576573
DOI10.1007/s003730050014zbMath0966.05041OpenAlexW4250290902MaRDI QIDQ1576573
Publication date: 16 August 2001
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730050014
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Connectivity (05C40)
Related Items (61)
Group connectivity of graphs with diameter at most 2 ⋮ \(Z_3\)-connectivity of claw-free graphs ⋮ Group connectivity of complementary graphs ⋮ An extremal problem on bigraphic pairs with an \(A\)-connected realization ⋮ Nowhere-zero 3-flows and \(Z_3\)-connectivity of graphs without two forbidden subgraphs ⋮ Neighborhood unions and \(Z_3\)-connectivity in graphs ⋮ Degree sum of a pair of independent edges and \(Z_{3}\)-connectivity ⋮ Group connectivity of bridged graphs ⋮ Spanning triangle-trees and flows of graphs ⋮ Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization ⋮ Nowhere-zero 3-flow of graphs with small independence number ⋮ Group connectivity in 3-edge-connected graphs ⋮ Degree sum of 3 independent vertices and \(Z_3\)-connectivity ⋮ A note on \(Z_3\)-connected graphs with degree sum condition ⋮ \(Z_3\)-connectivity in abelian Cayley graphs ⋮ Eulerian subgraphs and \(S\)-connectivity of graphs ⋮ Realizing degree sequences as \(Z_3\)-connected graphs ⋮ On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs ⋮ Group connectivity under 3‐edge‐connectivity ⋮ Group connectivity of graphs satisfying the Chvátal-condition ⋮ Nowhere-zero 3-flows in Cayley graphs on generalized dihedral group and generalized quaternion group ⋮ Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees ⋮ \(Z_3\)-connectivity of wreath product of graphs ⋮ Degree condition and \(Z_3\)-connectivity ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ Nowhere-zero 3-flows in matroid base graph ⋮ An extremal problem on group connectivity of graphs ⋮ Bigraphic pairs with an \(A\)-connected realization ⋮ Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs ⋮ A dual version of the brooks group coloring theorem ⋮ Group connectivity in line graphs ⋮ Flows and parity subgraphs of graphs with large odd-edge-connectivity ⋮ Nowhere-zero flows on signed wheels and signed fans ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization ⋮ \(Z_3\)-connectivity of 4-edge-connected 2-triangular graphs ⋮ All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected ⋮ Equivalent versions of group-connectivity theorems and conjectures ⋮ Graphic sequences with an \(A\)-connected realization ⋮ Ore-condition and \(Z_3\)-connectivity ⋮ Group chromatic number of Halin graphs ⋮ A complete characterization of graphic sequences with a \(Z_3\)-connected realization ⋮ Modulo 5-orientations and degree sequences ⋮ Nowhere-zero 3-flows in triangularly connected graphs ⋮ Pósa-condition and nowhere-zero 3-flows ⋮ Degree conditions for group connectivity ⋮ The Chvátal-Erdős condition for group connectivity in graphs ⋮ Degree sum condition for \(Z_{3}\)-connectivity in graphs ⋮ Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs ⋮ Degree sum and nowhere-zero 3-flows ⋮ \(Z_3\)-connectivity with independent number 2 ⋮ Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected ⋮ Nowhere-zero 3-flows of claw-free graphs ⋮ Maximum degree condition and group connectivity ⋮ EVERY N2-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z3-CONNECTED ⋮ Group connectivity and group coloring: small groups versus large groups ⋮ On 3-flow-critical graphs ⋮ Nowhere-zero 3-flows in toroidal graphs ⋮ Weighted modulo orientations of graphs and signed graphs ⋮ Group connectivity and matchings ⋮ Group connectivity in \(J_3\) line graphs
This page was built for publication: Group connectivity of 3-edge-connected chordal graphs
