An extremal problem on bigraphic pairs with an \(A\)-connected realization
From MaRDI portal
Publication:284713
DOI10.1016/j.disc.2016.02.014zbMath1336.05070OpenAlexW2343870018MaRDI QIDQ284713
Publication date: 18 May 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.02.014
Related Items (4)
Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization ⋮ Bigraphic pairs with an \(A\)-connected realization ⋮ The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization ⋮ Solutions to problems about potentially \(K_{s,t}\)-bigraphic pair
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Realizing degree sequences as \(Z_3\)-connected graphs
- An extremal problem on group connectivity of graphs
- Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs
- Graphic sequences with an \(A\)-connected realization
- A complete characterization of graphic sequences with a \(Z_3\)-connected realization
- A theorem on flows in networks
- Ore-condition and \(Z_3\)-connectivity
- 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: An extremal problem on bigraphic pairs with an \(A\)-connected realization
