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 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.
Wikipage disambiguates
primaryTopic
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 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.
has abstract
Barnette's conjecture is an un ...... ertex has a Hamiltonian cycle.
@en
Link from a Wikipage to an external page
Wikipage page ID
28,059,825
Wikipage revision ID
745,188,719
authorlink
first
last
title
Barnette's Conjecture
urlname
BarnettesConjecture
hypernym
type
comment
Barnette's conjecture is an un ...... ertex has a Hamiltonian cycle.
@en
label
Barnette's conjecture
@en