Realizing degree sequences with S₃-connected graphs

DOI10.1002/JGT.70062MaRDI QIDQ7314099zbMATH OpenFDO

Authors Rui Guan, Chenglin Jiang, Hong-Jian Lai, Jiaao Li, Xin-yuan Li

Publication date 13 August 2026

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/JGT.70062

Mathematics Subject Classification ID

Vertex degrees (05C07) Flows in graphs (05C21) Connectivity (05C40)

Cites work

• A complete characterization of graphic sequences with a \(Z_3\)-connected realization
• A method in graph theory
• An extremal problem on potentially \(K_{r,s}\)-graphic sequences
• Complementary graphs with flows less than three
• Contractible graphs for flow index less than three
• Graph theory
• Group connectivity of 3-edge-connected chordal graphs
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• Integer flows and orientations
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Realizing degree sequences as \(Z_3\)-connected graphs
• Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
• The flow index and strongly connected orientations

This page was built for publication: Realizing degree sequences with \(\mathcal{S}_3\)-connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314099)