Modulo 5-orientations and degree sequences
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4075098 (Why is no real title available?)
- A Contribution to the Theory of Chromatic Polynomials
- A complete characterization of graphic sequences with a \(Z_3\)-connected realization
- A note on an extremal problem for group-connectivity
- Counterexamples to Jaeger's circular flow conjecture
- Graph theory
- Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
- Group connectivity of 3-edge-connected chordal graphs
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Line removal algorithms for graphs and their degree lists
- Mod (2p + 1)-Orientations and $K_{1,2p+1}$-Decompositions
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs
- Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
- Realizing degree sequences as \(Z_3\)-connected graphs
This page was built for publication: Modulo 5-orientations and degree sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741509)