In Daniel Marcus's Graph Theory - A Problem Oriented Approach:
According to the integral flow decomposition theorem, a flow with value n can be written as the sum of n unit path flows and possibly some cycle flows.
In problem 6, this theorem is supposed to apply in two different ways on the following flow:
But I can only find the decomposition: UAB + AVC + 2(UABCV)
Have I misunderstood something?