Year: 2024
Type: preprint
Abstract: The existence of Hamiltonian cycles in 1-planar graphs with higher connectivity has attracted considerable attention. Recently, the authors and Dong proved that 4-connected 1-planar chordal graphs are Hamiltonian-connected. In this paper, we investigate the non-Hamiltonicity of a broader class of graphs, specifically perfect graphs, under the constraint of 1-planarity, with a focus on connectivity of at most 5. We also propose some unsolved problems.
Source: arXiv (Cornell University)
Authors: Zhang, Licheng, Lv, Shengxiang, Huang, Yuanqiu
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Award: G2074791566
OpenAlex ID: W4404350079
