D-CTF 2014: Misc 200 – A conjecture

Category: Misc Points: 200 Description:

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

Write-up

Barnette’s conjecture is an unsolved problem. The flag is unsolved problem.

Other write-ups and resources

• none yet