Hamilton-laceable bi-powers of locally finite bipartite graphs
Abstract
In this paper we strengthen a result due to Li by showing that the third bi-power of a locally finite connected bipartite graph that admits a perfect matching is Hamilton-laceable, i.e. any two vertices from different bipartition classes are endpoints of some common Hamilton arc.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.