1 paper
Katja Mönius, Jörn Steuding, Pascal Stumpf
We investigate a descent on simple graphs, starting with the complete graph on n vertices and ending up with the cycle graph by removing one edge after another. We obtain quantit…