Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.20706 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912353435516928 |
|---|---|
| author | Shao, Sihong Wu, Yuxuan |
| author_facet | Shao, Sihong Wu, Yuxuan |
| contents | We prove that every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian, and show that the 6-face condition is tight. Our results push the connectivity condition of the Barnette-Goodey conjecture to the weakest possible. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_20706 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian Shao, Sihong Wu, Yuxuan Combinatorics We prove that every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian, and show that the 6-face condition is tight. Our results push the connectivity condition of the Barnette-Goodey conjecture to the weakest possible. |
| title | Every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2504.20706 |