Bigraphic pairs with an \(A\)-connected realization
From MaRDI portal
Publication:1706118
DOI10.1016/j.dam.2017.12.026zbMath1410.05025OpenAlexW2782888892MaRDI QIDQ1706118
Publication date: 21 March 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.12.026
Related Items (1)
Cites Work
- An extremal problem on bigraphic pairs with an \(A\)-connected realization
- Realizing degree sequences as \(Z_3\)-connected graphs
- A note on an extremal problem for group-connectivity
- An extremal problem on group connectivity of 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
- 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
- Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization
- Group connectivity and group colorings of graphs --- a survey
- Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
- Combinatorial Properties of Matrices of Zeros and Ones
- Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
- Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bigraphic pairs with an \(A\)-connected realization