Originator(s): William Tutte (U. Waterloo)
Conjecture/Question: Every 4-edge-connected graph is 3-flowable.
Definitions/Background/motivation:
Comments/Partial results: Statements of the conjecture appear in Steinberg [S] and Bondy-Murty [BM, Unsolved Problem 48].
References: