One direction of the characterisation states that every planar graph has a 2-basis.
Alternatively, it is possible to use Euler's formula to show that the number of cycles in this collection equals the circuit rank of , which is the dimension of the cycle space.