On Barnette's conjecture (Q968428): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1208.4332 / rank | |||
Normal rank | |||
Revision as of 19:21, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
