Paper 2, Section II, F

Graph Theory
Part II, 2013

Let GG be a graph with G3|G| \geqslant 3. State and prove a necessary and sufficient condition for GG to be Eulerian (that is, for GG to have an Eulerian circuit).

Prove that if δ(G)G/2\delta(G) \geqslant|G| / 2 then GG is Hamiltonian (that is, GG has a Hamiltonian circuit).

The line graph L(G)L(G) of GG has vertex set V(L(G))=E(G)V(L(G))=E(G) and edge set

E(L(G))={ef:e,fE(G),e and f are incident }.E(L(G))=\{e f: e, f \in E(G), e \text { and } f \text { are incident }\} .

Show that L(G)L(G) is Eulerian if GG is regular and connected.

Must L(G)L(G) be Hamiltonian if GG is Eulerian? Must GG be Eulerian if L(G)L(G) is Hamiltonian? Justify your answers.