A new proof of Seymour's 6-flow theorem

DOI10.1016/J.JCTB.2016.05.010zbMath1350.05053arXiv1512.06214OpenAlexW2963874773WikidataQ105342589 ScholiaQ105342589MaRDI QIDQ345081

Edita Rollová, Robert Šámal, Matt DeVos

Publication date: 25 November 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.06214

zbMATH Keywords

6-flownowhere-zero flow

Mathematics Subject Classification ID

Flows in graphs (05C21)

Related Items (1)

Measures of edge-uncolorability of cubic graphs

Cites Work

• Unnamed Item
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Nowhere-zero 6-flows
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: A new proof of Seymour's 6-flow theorem