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.
Recommendations
Cites work
- Cycles through all finite vertex sets in infinite graphs
- Graph theory
- Graph-theoretical versus topological ends of graphs.
- scientific article; zbMATH DE number 3192675 (Why is no real title available?)
- Infinite Hamilton cycles in squares of locally finite graphs
- On infinite cycles. I, II
- The square of every two-connected graph is Hamiltonian
- Topological paths, cycles and spanning trees in infinite graphs
- Wurzelbäume und unendliche Wege in Graphen
Cited in
(4)
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)