Question 4
Suppose $G$ is a connected graph with $n$ edges. Prove that it is possible to label the edges of $G$ from 1 to $n$ in such a way that in every vertex $v$ of $G$ with two or more incident edges, the set of numbers labeling those edges has no common divisor greater than 1.