On the chromatic number of powers of subdivisions of graphs

Michael Anastos, Simona Boyadzhiyska, Silas Rathke +1

For a given graph $G=(V,E)$, we define its \emph{$n$th subdivision} as the graph obtained from $G$ by replacing every edge by a path of length $n$. We also define the \emph{$m$th p…