论文标题
与哈密顿或哈密顿连接正方形的图形最通用的结构
The most general structure of graphs with hamiltonian or hamiltonian connected square
论文作者
论文摘要
根据最新的2街区正方形中汉密尔顿和哈密顿的联系的结果，我们确定了$ g $的最通用的块状污垢结构，以确保$ g^2 $分别是汉密尔顿，汉密尔顿连接的汉密尔顿。这种方法已经为哈密顿的总图开发了。
On the basis of recent results on hamiltonicity and hamiltonian connectedness in the square of a 2-block, we determine the most general block-cutvertex structure a graph $G$ may have in order to guarantee that $G^2$ is hamiltonian, hamiltonian connected, respectively. Such an approach was already developed for hamiltonian total graphs.
