Barnette's conjecture
Statement
Let be a finite undirected graph with the following four properties:
is planar: it can be embedded in the Euclidean plane with no two edges crossing. 2. is -vertex-connected: has at least vertices and, for every set of at most two vertices, the graph obtained by deleting and all incident edges is connected. (A planar -connected graph is called polyhedral.) 3. is bipartite: its vertex set admits a partition into two classes such that every edge of has one endpoint in each class. 4. is cubic (-regular): every vertex of is an endpoint of exactly three edges.
Then is Hamiltonian, i.e. contains a cycle passing through each of its vertices exactly once.
Equivalently, in the language of polytopes: if is a simple -dimensional convex polytope (every vertex of lies on exactly three edges) such that every face of has an even number of edges, then the graph formed by the vertices and edges of has a Hamiltonian cycle.
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.