Barnette Graphs with Faces up to Size 8 are Hamiltonian
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916882642108416 |
|---|---|
| author | Schnieders, Tobias |
| author_facet | Schnieders, Tobias |
| contents | Barnette's conjecture states that every cubic, bipartite, planar and 3-connected graph is Hamiltonian. Goodey verified Barnette's conjecture for all graphs with faces of size up to 6.
We substantially strengthen Goodey's result by proving Hamiltonicity for cubic, bipartite, planar and (2-)connected graphs with faces of size up to 8. Parts of the proof are computational, including a distinction of 339.068.624 cases. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_03531 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Barnette Graphs with Faces up to Size 8 are Hamiltonian Schnieders, Tobias Combinatorics Metric Geometry 05C45 (Primary) 05C10, 52B05, 52B10 (Secondary) Barnette's conjecture states that every cubic, bipartite, planar and 3-connected graph is Hamiltonian. Goodey verified Barnette's conjecture for all graphs with faces of size up to 6. We substantially strengthen Goodey's result by proving Hamiltonicity for cubic, bipartite, planar and (2-)connected graphs with faces of size up to 8. Parts of the proof are computational, including a distinction of 339.068.624 cases. |
| title | Barnette Graphs with Faces up to Size 8 are Hamiltonian |
| topic | Combinatorics Metric Geometry 05C45 (Primary) 05C10, 52B05, 52B10 (Secondary) |
| url | https://arxiv.org/abs/2508.03531 |