A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Are highly connected 1-planar graphs Hamiltonian?
[article]
2019
arXiv
pre-print
Preserved Fulltext
It is well-known that every planar 4-connected graph has a Hamiltonian cycle. In this paper, we study the question whether every 1-planar 4-connected graph has a Hamiltonian cycle. We show that this is false in general, even for 5-connected graphs, but true if the graph has a 1-planar drawing where every region is a triangle.
arXiv:1911.02153v1
fatcat:v2w2mtwuvbe5xhamignpmimwkm