加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本