We develop the first case of Fermat's Last Theorem for exponent p in the case where p and 6p+1 are prime (so that Sophie Germain's proof does not directly apply).
For any simple Eulerian graph of order n and maximum degree ≤4 we show that one needs ≤(n−1)/2 edge disjoint cycles to partition the edges of the graph.