If you can complete this, then you deserve a PhD

Every bipartite polyhedral graph with three edges per vertex has a Hamiltonian cycle. Prove.

Please tick when response verified

{"name":"If you can complete this, then you deserve a PhD", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Every bipartite polyhedral graph with three edges per vertex has a Hamiltonian cycle. Prove.","img":"https://www.quiz-maker.com/3012/images/ogquiz.png"}