Matrix reduction in a combinatorial computation

DOI10.1016/J.IPL.2010.11.008zbMath1259.05072OpenAlexW2078897456MaRDI QIDQ1944064

Martin Kochol, Silvia Smejová, Nad'a Krivoňáková, Katarína Šranková

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.11.008

zbMATH Keywords

combinatorial problemsrank of a matrixgirth of a graphnowhere-zero \(5\)-flow

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Flows in graphs (05C21)

Related Items (1)

Smallest counterexample to the 5-flow conjecture has girth at least eleven

Cites Work

• Unnamed Item
• Counting nowhere-zero flows on wheels
• Smallest counterexample to the 5-flow conjecture has girth at least eleven
• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
• Superposition and constructions of graphs without nowhere-zero \(k\)-flows
• Restrictions on smallest counterexamples to the 5-flow conjecture
• Decomposition formulas for the flow polynomial
• A Class Of Abelian Groups
• A Contribution to the Theory of Chromatic Polynomials
• Tutte's 5-flow conjecture for highly cyclically connected cubic graphs

This page was built for publication: Matrix reduction in a combinatorial computation