Hamilton-laceable bi-powers of locally finite bipartite graphs

From MaRDI portal
Publication:2138950



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.












This page was built for publication: Hamilton-laceable bi-powers of locally finite bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138950)