Integer flows
Daniel H. Younger · Journal of Graph Theory · 1983
Abstract A k‐flow is an assignment of edge directions and integer weights in the range 1, …., k – 1 to the edges of an undirected graph so that ateach vertex the flow in is equal to the flow out. This paper gives a polynomial algorithm for finding a 6‐flow that applies uniformly to each graph. The algorithm specializes to give a 5‐flow for planar graphs.