Restrictions on smallest counterexamples to the 5-flow conjecture

DOI10.1007/s00493-006-0006-1zbMath1100.05034OpenAlexW2078030919WikidataQ122867956 ScholiaQ122867956MaRDI QIDQ2495696

Martin Kochol

Publication date: 5 October 2006

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-006-0006-1

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Nowhere-zero 5-flows and even (1,2)-factors ⋮ Nowhere-zero 5-flows and (1, 2)-factors ⋮ Matrix reduction in a combinatorial computation ⋮ Is the five-flow conjecture almost false? ⋮ Counting nowhere-zero flows on wheels ⋮ Tutte's 5-flow conjecture for highly cyclically connected cubic graphs ⋮ Smallest counterexample to the 5-flow conjecture has girth at least eleven ⋮ Snarks with given real flow numbers ⋮ Nowhere-zero -flows on wheels

This page was built for publication: Restrictions on smallest counterexamples to the 5-flow conjecture