Abstract
Recently we have developed a method excluding certain subgraphs from a smallest counterexample to the 5-flow conjecture. This is based on comparing ranks of two matrices of large size. The aim of this paper is to be more effective by applying these methods so that we reduce the size of matrices used in the computation. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Kochol, M., Krivoňáková, N., Smejová, S., & Šranková, K. (2011). Reductions of matrices associated with nowhere-zero flows. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6460 LNCS, pp. 192–200). https://doi.org/10.1007/978-3-642-19222-7_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
