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 , 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
Link from a Wikipage to another Wikipage
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 , 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
Гипотеза Барнетта — нерешённый ...... ершине имеет гамильтонов цикл.
@ru
Гіпо́теза Ба́рнетта є припущен ...... вершині має гамільтонів цикл.
@uk
Link from a Wikipage to an external page
Wikipage page ID
28,059,825
page length (characters) of wiki page
Wikipage revision ID
1,025,921,229
Link from a Wikipage to another Wikipage
authorlink
Peter Tait
@en
W. T. Tutte
@en
first
P. G.
@en
W. T.
@en
last
Tait
@en
Tutte
@en
mode
cs2
@en
title
Barnette's Conjecture
@en
urlname
BarnettesConjecture
@en
wikiPageUsesTemplate
hypernym
type
comment
Barnette's conjecture is an un ...... ertex has a Hamiltonian cycle.
@en
Гипотеза Барнетта — нерешённый ...... ершине имеет гамильтонов цикл.
@ru
Гіпо́теза Ба́рнетта є припущен ...... вершині має гамільтонів цикл.
@uk
label
Barnette's conjecture
@en
Гипотеза Барнетта
@ru
Гіпотеза Барнета
@uk