Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization

DOI10.1007/s10114-017-6380-3zbMath1369.05121OpenAlexW2604610435MaRDI QIDQ2404100

Jian Hua Yin, Xiang-Yu Dai

Publication date: 12 September 2017

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-017-6380-3

zbMATH Keywords

\(Z_3\)-connected realizationgroup connectivitybigraphic pair

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex degrees (05C07)

Related Items (2)

Bigraphic pairs with an \(A\)-connected realization ⋮ The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An extremal problem on bigraphic pairs with an \(A\)-connected realization
• An extremal problem on group connectivity of graphs
• Graphic sequences with an \(A\)-connected realization
• A theorem on flows in networks
• 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
• A remark on the existence of finite graphs
• Combinatorial Properties of Matrices of Zeros and Ones
• 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

This page was built for publication: Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization