Hamiltonicity of bi-power of bipartite graphs, for finite and infinite cases

Abstract

For a graph $G$, the $t$-th power $G^t$ is the graph on $V(G)$ such that two vertices are adjacent if and only if they have distance at most $t$ in $G$; and the $t$-th bi-power $G_B^t$ is the graph on $V(G)$ such that two vertices are adjacent if and only if their distance in $G$ is odd at most $t$. Fleischner's theorem states that the square of every 2-connected finite graph has a Hamiltonian cycle. Georgakopoulos prove that the square of every 2-connected infinite locally finite graph has a Hamiltonian circle. In this paper, we consider the Hamiltonicity of the bi-power of bipartite graphs. We show that for every connected finite bipartite graph $G$ with a perfect matching, $G_B^3$ has a Hamiltonian cycle. We also show that if $G$ is a connected infinite locally finite bipartite graph with a perfect matching, then $G_B^3$ has a Hamiltonian circle.

11 pages

References in corpus (2)

• A sufficient condition for Hamiltonicity in locally finite graphs
• A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs