Near-perfect matchings in highly connected 1-planar graphs with a local crossing constraint

Licheng Zhang Yuanqiu Huang Zhangdong Ouyang

For planar graphs, it is well known that high connectivity implies a Hamiltonian cycle and hence any 4-connected planar graph has a near-perfect matching. Nevertheless, whether 6-c…