New results on edge-coloring and total-coloring of split graphs

A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. A connected graph $G$ is said to be $t$-admissible if admits a special spanning tree in which the distance between any two adjacent vertices is at most $t$. Given a graph $G$, determining the smallest $t$ for which $G$ is $t$-admissible, i.e., the stretch index of $G$, denoted by $\sigma \left(G\right)$, is the goal of the $t$-admissibility problem. Split graphs are 3-admissible and can be partitioned into three subclasses: split graphs with $\sigma =1,2$ or 3. In this work we consider such a partition while dealing with the problem of coloring a split graph. Vizing proved that any graph can have its edges colored with $\Delta$ or $\Delta +1$ colors, and thus can be classified as Class 1 or Class 2, respectively. When both, edges and vertices, are simultaneously colored, it is conjectured that any graph can be colored with $\Delta +1$ or $\Delta +2$ colors, and thus can be classified as Type 1 or Type 2. Both variants are still open for split graphs. In this paper, using the partition of split graphs presented above, we consider the edge coloring problem and the total coloring problem for split graphs with $\sigma =2$. For this class, we characterize Class 2 and Type 2 graphs and we provide polynomial-time algorithms to color any Class 1 or Type 1 graph.