Ekstein, J., & Fleischner, H. (2024). The most general structure of graphs with hamiltonian or hamiltonian connected square. Discrete Mathematics, 347(1), Article 113702. https://doi.org/10.1016/j.disc.2023.113702
E192-01 - Forschungsbereich Algorithms and Complexity
-
Journal:
Discrete Mathematics
-
ISSN:
0012-365X
-
Date (published):
1-Jan-2024
-
Number of Pages:
9
-
Publisher:
ELSEVIER
-
Peer reviewed:
Yes
-
Keywords:
Block-cutvertex graph; Hamiltonian cycle; Hamiltonian path; Square of a graph
en
Abstract:
On the basis of recent results on hamiltonicity, [5], and hamiltonian connectedness, [9], in the square of a 2-block, we determine the most general block-cutvertex structure a graph G may have in order to guarantee that G² is hamiltonian, hamiltonian connected, respectively. Such an approach was already developed in [10] for hamiltonian total graphs.
