Papers
Topics
Authors
Recent
Search
2000 character limit reached

A computer-assisted proof of Barnette-Goodey conjecture: Not only fullerene graphs are Hamiltonian

Published 8 Sep 2014 in math.CO | (1409.2440v2)

Abstract: Fullerene graphs, i.e., 3-connected planar cubic graphs with pentagonal and hexagonal faces, are conjectured to be Hamiltonian. This is a special case of a conjecture of Barnette and Goodey, stating that 3-connected planar graphs with faces of size at most 6 are Hamiltonian. We prove the conjecture.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. František Kardoš 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up