Abstract
This is a project on k-(edge)-flow-critical graphs, which are graphs that do not admit a k-flow but the graph obtained after contracting any of its edges do admit a k-flow. We will focus on the study of snarks, that are cubic graphs that do not admit a 3-edge-colouring -- neither a 4-flow -- as Tutte has shown that a cubic graph admits a 3-edge-colouring if and only if it admits a 4-flow.…