The sum necessary to ensure that a degree sequence pair has an a-connected realization
From MaRDI portal
Publication:2223689
Recommendations
- Bigraphic pairs with an A-connected realization
- An extremal problem on bigraphic pairs with an \(A\)-connected realization
- Graphic sequences with an \(A\)-connected realization
- Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization
- The smallest degree sum that yields graphic sequences with a Z₃-connected realization
Cites work
- A Contribution to the Theory of Chromatic Polynomials
- A note on an extremal problem for group-connectivity
- A theorem on flows in networks
- An extremal problem on bigraphic pairs with an \(A\)-connected realization
- An extremal problem on group connectivity of graphs
- Bigraphic pairs with an A-connected realization
- Combinatorial Properties of Matrices of Zeros and Ones
- Graph theory with applications
- Graphic sequences with an \(A\)-connected realization
- Group connectivity for \(K^{-k}_{m, n}\)
- Group connectivity of 3-edge-connected chordal graphs
- Group connectivity of certain graphs
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
- scientific article; zbMATH DE number 4075098 (Why is no real title available?)
- On the Imbedding of Linear Graphs in Surfaces
- Ore-condition and \(Z_3\)-connectivity
- Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization
- The smallest degree sum that yields graphic sequences with a Z₃-connected realization
Cited in
(4)
This page was built for publication: The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223689)