Problem

Source: Canada RepĂȘchage 2020/4 CMOQR

Tags: graph theory, graph, Hamiltonian path, combinatorics



Determine all graphs $G$ with the following two properties: $\bullet$ G contains at least one Hamilton path. $\bullet$ For any pair of vertices, $u, v \in G$, if there is a Hamilton path from $u$ to $v$ then the edge $uv$ is in the graph $G$