Line graph of a regular graph is Eulerian (source code)

= Line graph of a regular graph is Eulerian

If $G$ is a finite <connected graph> <simple graph> that is $r$-<regular graph> with $r\geq1$, then $L(G)$ is connected and every one of its vertices has degree $2r-2$. The <Euler circuit criterion> therefore applies.