In 1859 the Irish mathematician Sir William Rowan Hamilton proposed a game in which it was required to find a dodecahedron bypass around its edges with a return to the starting point. In his honor, the corresponding path in the graph was later called the Hamiltonian cycle: it is the spanning cycle in the graph, that is, the cycle passing through all the vertices of the graph. A graph containing a Hamiltonian cycle is said to be Hamiltonian. In 1952 Dirac proposed a sufficient condition for the graph to be Hamiltonian: if the degree of each vertex is not less than half of the total number of vertices of the graph, then such a graph is Hamiltonian. Subsequently, many different sufficient conditions for Hamiltonicity were obtained, of which a large group is formed by so-called Dirac-type conditions or sufficient conditions formulated in terms of degrees of the vertices of the graph: sufficient conditions by Ore, Pocha, Chvatal and others. In 1976 Bondy and Chvatal proposed a closure construction for the graph and a new sufficient condition: if the closure of a graph is a complete graph, then the graph itself is Hamiltonian. This condition remains one of the most effective sufficient condition. In this paper, we will investigate the sufficient condition for the Hamiltonian graph by Goodman–Hedetniemi, which is formulated in terms of forbidden subgraphs. We give a description of all graphs that satisfy the Goodman–Hedetniemi condition and prove that for $n>4$ there are only $\left\lfloor n / 2 \right\rfloor + 2$ such $n$-vertex graphs.