Summary: To any simple graph \(G\), the clique graph operator \(K\) assigns the graph \(K(G)\), which is the intersection graph of the maximal complete subgraphs of \(G\). The iterated clique graphs are defined by \(K^0 (G)=G\) and \(K^n (G)=K(K^{n-1}(G))\) for \(n\geq 1\). We associate topological concepts to graphs by means of the simplicial complex \(\mathrm{Cl}(G)\) of complete subgraphs of \(G\). Hence, we say that the graphs \(G_1\) and \(G_2\) are homotopic whenever \(\mathrm{Cl}(G_1)\) and \(\mathrm{Cl}(G_2)\) are. A graph \(G\) such that \(K^n (G)\simeq G\) for all \(n\geq 1\) is called \(K\)-homotopy permanent. A graph is Helly if the collection of maximal complete subgraphs of \(G\) has the Helly property. Let \(G\) be a Helly graph. F. Escalante [Abh. Math. Semin. Univ. Hamb. 39, 58–68 (1973; Zbl 0266.05116)] proved that \(K(G)\) is Helly, and E. Prisner [Discrete Math. 103, No. 2, 199–207 (1992; Zbl 0766.05096)] proved that \(G\simeq K(G)\), and so Helly graphs are \(K\)-homotopy permanent. We conjecture that if a graph \(G\) satisfies that \(K^m (G)\) is Helly for some \(m\geq 1\), then \(G\) is \(K\)-homotopy permanent. If a connected graph has maximum degree at most four and is different from the octahedral graph, we say that it is a low degree graph. It was recently proven that all low-degree graphs \(G\) satisfy that \(K^2 (G)\) is Helly. In this paper, we show that all low-degree graphs have the homotopy type of a wedge or circumferences and that they are \(K\)-homotopy permanent.