The most general structure of graphs with hamiltonian or hamiltonian connected square
Combinatorics
2023-09-28 v3
Abstract
On the basis of recent results on hamiltonicity and hamiltonian connectedness in the square of a 2-block, we determine the most general block-cutvertex structure a graph may have in order to guarantee that is hamiltonian, hamiltonian connected, respectively. Such an approach was already developed for hamiltonian total graphs.
Keywords
Cite
@article{arxiv.2203.12665,
title = {The most general structure of graphs with hamiltonian or hamiltonian connected square},
author = {J. Ekstein and H. Fleischner},
journal= {arXiv preprint arXiv:2203.12665},
year = {2023}
}
Comments
18 pages