Barnette's conjecture

Barnette's conjecture is an unsolved problem in graph theory, a branch of mathematics, concerning Hamiltonian cycles in graphs. It is named after… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2006-2016
01220062016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We prove a new sufficient condition for a cubic 3-connected planar graph to be Hamiltonian. This condition is most easily… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2016
2016
 
Is this relevant?
2010
2010
Barnette’s conjecture is the statement that every cubic 3-connected bipartite planar graph is Hamiltonian. We show that if such a… (More)
  • figure 1
Is this relevant?
2010
2010
We show that all spherical Eulerian triangulations can be inductively generated from the set of all even double wheels using just… (More)
  • figure 1
Is this relevant?
2006
2006
Barnette’s conjecture is the statement that every 3-connected cubic planar bipartite graph is Hamiltonian. Goodey showed that the… (More)
Is this relevant?
Review
2006
Review
2006
Tait and Tutte made famous conjectures stating that all members of certain graph classes contain Hamiltonian Cycles. Although the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?