Equivalent versions of group-connectivity theorems and conjectures
From MaRDI portal
(Redirected from Equivalent versions of group-connectivity theorems and conjectures)
Recommendations
Cites work
- 3-flows and combs
- A Contribution to the Theory of Chromatic Polynomials
- A note on nowhere-zero 3-flows and Z₃-connectivity
- An equivalent version of the 3-flow conjecture
- Group connectivity of 3-edge-connected chordal graphs
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- scientific article; zbMATH DE number 3904637 (Why is no real title available?)
- scientific article; zbMATH DE number 4075098 (Why is no real title available?)
- Integer flows and orientations
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Nowhere-zero 3-flows in triangularly connected graphs
- Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees
- Superposition and constructions of graphs without nowhere-zero k-flows
- The weak 3-flow conjecture and the weak circular flow conjecture
- Unsolved graph colouring problems
Cited in
(4)
This page was built for publication: Equivalent versions of group-connectivity theorems and conjectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1730259)
