Realizing degree sequences as \(Z_3\)-connected graphs

DOI10.1016/j.disc.2014.06.019zbMath1298.05080arXiv1407.3531OpenAlexW2147279753MaRDI QIDQ400414

Hong-Jian Lai, Xiangwen Li, Fan Yang

Publication date: 21 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.3531

zbMATH Keywords

degree sequence\(Z_3\)-connectivitynowhere-zero 3-flow

Mathematics Subject Classification ID

Connectivity (05C40) Vertex degrees (05C07)

Related Items (4)

An extremal problem on bigraphic pairs with an \(A\)-connected realization ⋮ Bigraphic pairs with an \(A\)-connected realization ⋮ A complete characterization of graphic sequences with a \(Z_3\)-connected realization ⋮ Modulo 5-orientations and degree sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An extremal problem on group connectivity of graphs
• Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
• Ore-condition and \(Z_3\)-connectivity
• Nowhere-zero 3-flows in triangularly connected graphs
• Degree sequence and supereulerian graphs
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group connectivity of 3-edge-connected chordal graphs
• The smallest degree sum that yields graphic sequences with a \(Z_3\)-connected realization
• Group connectivity and group colorings of graphs --- a survey
• 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
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
• A Contribution to the Theory of Chromatic Polynomials
• Research problems

This page was built for publication: Realizing degree sequences as \(Z_3\)-connected graphs