I'm sure I read an old article by Dijkstra about connected graphs structure that was titled "wheels within wheels" or used the term inside. Unfortunately I can

I'm sure I read an old article by Dijkstra about connected graphs structure that was titled "wheels within wheels" or used the term inside. Unfortunately I can't find it by either searching or using the public LLMs, because there are too many results about the shortest path algorithm and anything else about dijkstra is lost.