Hypothetical complexity of the nowhere-zero 5-flow problem
Martin Kochol · Journal of Graph Theory · 1998
We show that if the well-known 5-Flow Conjecture of Tutte is not true, then the problem to determine whether a (cubic) graph admits a nowhere-zero 5-flow is NP-complete. © 1998 John Wiley & Sons, Inc. J Graph Theory 28: 1–11, 1998