Matrix reduction in a combinatorial computation
type: Item
instance of: scholarly article
title: Matrix reduction in a combinatorial computation
zbMATH Open document ID: 1259.05072
author: Martin Kochol
author: Nad'a Krivoňáková
author: Silvia Smejová
author: Katarína Šranková
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 05C21
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 6150247
zbMATH Keywords: combinatorial problems
zbMATH Keywords: rank of a matrix
zbMATH Keywords: nowhere-zero \(5\)-flow
zbMATH Keywords: girth of a graph
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.11.008
OpenAlex ID: W2078897456
cites work: Q3807237
cites work: Superposition and constructions of graphs without nowhere-zero \(k\)-flows
cites work: Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
cites work: Decomposition formulas for the flow polynomial
cites work: Restrictions on smallest counterexamples to the 5-flow conjecture
cites work: Smallest counterexample to the 5-flow conjecture has girth at least eleven
cites work: Counting nowhere-zero flows on wheels
cites work: Tutte's 5-flow conjecture for highly cyclically connected cubic graphs
cites work: A Contribution to the Theory of Chromatic Polynomials
cites work: A Class Of Abelian Groups
DOI: 10.1016/J.IPL.2010.11.008
description: scientific article; zbMATH DE number 6150247