A note on optimal 2-planar graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914526795923456 |
|---|---|
| author | Zhang, Licheng Huang, Yuanqiu Ouyang, Zhangdong |
| author_facet | Zhang, Licheng Huang, Yuanqiu Ouyang, Zhangdong |
| contents | In this note, we prove that every 4-connected optimal 2-planar graph is Hamiltonian-connected. Furthermore, we show that the 4-connectedness condition is sharp by constructing infinitely many 3-connected optimal 2-planar graphs that are non-Hamiltonian. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_11535 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A note on optimal 2-planar graphs Zhang, Licheng Huang, Yuanqiu Ouyang, Zhangdong Combinatorics In this note, we prove that every 4-connected optimal 2-planar graph is Hamiltonian-connected. Furthermore, we show that the 4-connectedness condition is sharp by constructing infinitely many 3-connected optimal 2-planar graphs that are non-Hamiltonian. |
| title | A note on optimal 2-planar graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2512.11535 |