Hamilton-laceable bi-powers of locally finite bipartite graphs

Karl Heuer

doi:10.1016/j.disc.2021.112777

Hamilton-laceable bi-powers of locally finite bipartite graphs

Karl Heuer

Research output: Contribution to journal › Journal article › Research › peer-review

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.

Original language	English
Article number	112777
Journal	Discrete Mathematics
Volume	345
Issue number	7
Number of pages	8
ISSN	0012-365X
DOIs	https://doi.org/10.1016/j.disc.2021.112777
Publication status	Published - Jul 2022

Keywords

Bi-power
Bipartite graphs
Freudenthal compactification
Hamiltonicity
Locally finite graphs

Access to Document

10.1016/j.disc.2021.112777

https://arxiv.org/pdf/2104.03199.pdfLicence: CC BY-NC-ND

OpenUrl availability

Check availability in DTU Findit

Cite this

@article{fcecf227a64d461f9d80e8876e22347f,

title = "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.",

keywords = "Bi-power, Bipartite graphs, Freudenthal compactification, Hamiltonicity, Locally finite graphs",

author = "Karl Heuer",

note = "Publisher Copyright: {\textcopyright} 2022 The Author",

year = "2022",

month = jul,

doi = "10.1016/j.disc.2021.112777",

language = "English",

volume = "345",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "7",

}

TY - JOUR

T1 - Hamilton-laceable bi-powers of locally finite bipartite graphs

AU - Heuer, Karl

PY - 2022/7

Y1 - 2022/7

N2 - 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.

AB - 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.

KW - Bi-power

KW - Bipartite graphs

KW - Freudenthal compactification

KW - Hamiltonicity

KW - Locally finite graphs

U2 - 10.1016/j.disc.2021.112777

DO - 10.1016/j.disc.2021.112777

M3 - Journal article

AN - SCOPUS:85125704378

SN - 0012-365X

VL - 345

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 7

M1 - 112777

ER -

Hamilton-laceable bi-powers of locally finite bipartite graphs

Abstract

Keywords

Access to Document

OpenUrl availability

Fingerprint

Cite this