ON INTERVAL EDGE-COLORINGS OF COMPLETE MULTIPARTITE GRAPHS
Levon N. Muradyan · Proceedings of the YSU A Physical and Mathematical Sciences · 2022
A graph $G$ is called a complete $r$-partite $(r\geq 2)$ graph, if its vertices can be divided into $r$ non-empty independent sets $V_1,\ldots,V_r$ in a way that each vertex in $V_i$ is adjacent to all the other vertices in $V_j$ for $1\leq i