On Barnette's conjecture (Q968428): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: 1208.4332 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5315023 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonicity of cubic Cayley graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonian circuits in polytopes with even sided faces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convex Polytopes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Note on the Vertex Arboricity of a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonian cycles in cubic 3-connected bipartite planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4305231 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonicity of planar cubic multigraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: B-sets and planar maps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3888545 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5587076 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4530616 / rank | |||
Normal rank |
Latest revision as of 18:48, 2 July 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