# Revisiting the Hamiltonian Theme in the Square of a Block: The Case of DT-Graphs

## TL;DR

This paper explores Hamiltonian paths in the square of 2-connected graphs, extending known properties from 2-connected graphs to DT-graphs and general graphs, and clarifies limitations for larger k values.

## Contribution

It proves that all 2-connected DT-graphs have the F_4 property and generalizes this to all 2-connected graphs, resolving an open problem.

## Key findings

- Every 2-connected DT-graph has the F_4 property.
- The F_k property does not hold for all 2-connected graphs when k ≥ 5.
- The result confirms the existence of 2-connected graphs lacking the F_k property for large k.

## Abstract

The square of a graph G, denoted G^2, is the graph obtained from G by joining by an edge any two nonadjacent vertices which have a common neighbor. A graph G is said to have the F_k property if for any set of k distinct vertices {x_1, x_2, ..., x_k} in G, there is a hamiltonian path from x_1 to x_2 in G^2 containing k-2 distinct edges of G of the form x_iz_i, i = 3, ..., k. It was proved many years ago that every 2-connected graph has the F_3 property. In the first part of this work, we extend this result by proving that every 2-connected DT-graph has the F_4 property (Theorem 2) and will show in the second part that this generalization holds for arbitrary 2-connected graphs, and that there exist 2-connected graphs which do not have the F_k property for any natural number k >= 5. Altogether, this answers a problem raised before in the affirmative.