On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs

Aryan Sanghi, Anubhav Dhar, Sudeshna Kolay

Given a simple graph $G$, its line graph, denoted by $L(G)$, is obtained by representing each edge of $G$ as a vertex, with two vertices in $L(G)$ adjacent whenever the correspondi…