Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
From MaRDI portal
Recommendations
- Realizing degree sequences as \(Z_3\)-connected graphs
- Degree sum and nowhere-zero 3-flows
- Nowhere-zero 3-flows of highly connected graphs
- Nowhere-zero 3-flows in triangularly connected graphs
- Nowhere-zero 3-flows in squares of graphs
- NOWHERE-ZERO -FLOWS IN TWO FAMILIES OF VERTEX-TRANSITIVE GRAPHS
- Nowhere-zero 3-flows of graphs with independence number two
- Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs
- Nowhere‐zero 3‐flows in locally connected graphs
- Nowhere-zero 3-flows in semistrong product of graphs
Cited in
(18)- Bigraphic pairs with an A-connected realization
- Modulo 5-orientations and degree sequences
- 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 3-flows of graphs with independence number two
- An extremal problem on bigraphic pairs with an \(A\)-connected realization
- Degree sum of 3 independent vertices and \(Z_3\)-connectivity
- 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
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Graphic sequences with an \(A\)-connected realization
- A complete characterization of graphic sequences with a \(Z_3\)-connected realization
- Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
- Pósa-condition and nowhere-zero 3-flows
- Degree sequences and graphs with disjoint spanning trees
- Realizing degree sequences with \(\mathcal{S}_3\)-connected graphs
- Maximum degree condition and group connectivity
This page was built for publication: Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629459)
