Hamilton-laceable bi-powers of locally finite bipartite graphs
Combinatorics
2022-07-27 v2
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.
Cite
@article{arxiv.2104.03199,
title = {Hamilton-laceable bi-powers of locally finite bipartite graphs},
author = {Karl Heuer},
journal= {arXiv preprint arXiv:2104.03199},
year = {2022}
}
Comments
15 pages, 1 figure, short negative answers to Questions 4.3 and 4.4 have been added