On Barnette's conjecture (Q968428)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On Barnette's conjecture |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Barnette's conjecture |
scientific article |
Statements
On Barnette's conjecture (English)
0 references
5 May 2010
0 references
The famous and long-standing conjecture of Barnette claims that every cubic 3-connected bipartite planar graph is Hamiltonian. The author proves that if a graph contains a 2-factor that consists only of facial 4-cycles than the graph possesses Hamiltonian cycles with additional properties.
0 references
Barnette's conjecture
0 references
Hamilton cycle
0 references
2-factor
0 references
0.9239859580993652
0 references
0.9177698493003844
0 references
0.8970841765403748
0 references
0.8957541584968567
0 references
