Is every 3-connected 3-regular, planar bipartite graph Hamiltonian?

Barnette's conjecture is an unsolved problem in graph theory, a branch of mathematics, concerning Hamiltonian cycles in graphs. It is named after David W. Barnette, a professor emeritus at the University of California, Davis; it states that every bipartite polyhedral graph with three edges per vertex has a Hamiltonian cycle.

Very good. I guess my professor wants to see us suffer.

not really

Secure Information

Content will be erased after question is completed.

Enter the email address associated with your account, and we will email you a link to reset your password.

Forgot your password?

Sign Up