Matrix reduction in a combinatorial computation
From MaRDI portal
Publication:1944064
Recommendations
Cites work
- scientific article; zbMATH DE number 4075098 (Why is no real title available?)
- A Class Of Abelian Groups
- A Contribution to the Theory of Chromatic Polynomials
- Counting nowhere-zero flows on wheels
- Decomposition formulas for the flow polynomial
- Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
- Restrictions on smallest counterexamples to the 5-flow conjecture
- Smallest counterexample to the 5-flow conjecture has girth at least eleven
- Superposition and constructions of graphs without nowhere-zero k-flows
Cited in
(7)- scientific article; zbMATH DE number 6515828 (Why is no real title available?)
- Combinatorics in tensor-integral reduction
- Reductions of matrices associated with nowhere-zero flows
- Reduced form of the interactor matrix
- Smallest counterexample to the 5-flow conjecture has girth at least eleven
- Families of Algorithms for Reducing a Matrix to Condensed Form
- Reduction of a matrix using properties of the Schur complement
This page was built for publication: Matrix reduction in a combinatorial computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944064)