List Coloring of the Square of 4-Irregular Graphs
The square of a graph $G$ is the graph obtained from $G$ after adding an edge between any two vertices of distance $2$. A $k$-irregular graph is a graph with maximum degree $k$ such that vertices of degree $k$ are not adjacent. A \textit{list assignment} of a graph is a function $L$ that assigns to each vertex a list o...