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(G)$, 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, i.e., a total coloring of $G$, it is conjectured that any graph can be total colored with $\Delta+1$ or $\Delta+2$ colors, and thus can be classified as Type 1 or Type 2. These 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.

翻译：分割图是一个图表, 顶端可以分割成一个球形和一个独立的球形。 连接的图形$G$如果加入一个特殊的横幅树, 其中任何两个相邻的顶端之间的距离以美元最多为美元, 则该图形可以被分割成一个球形和独立的球形。 连接的图形$G$如果加入一个特殊的横幅树, 其中任何两个相邻的顶端之间的距离以美元最多为美元。 根据一张G$确定最小的美元, 其中G$可以被分割成一个球形和独立的球形。 也就是说, 一个G$G$的利差指数可以被分割成一个球形。 一个G$G$的利差指数可以被分割成一个球形, 一个G$的利差指数可以被分割成美元, 一个Glickral2 的颜色, 也可以被分类成一个色色色的颜色, 。 当两个色色色的颜色中, 两个色色的颜色, 一个色色的颜色, 一个色色的颜色, 一个色色的颜色, 一个色的颜色, 一个色色色的颜色, 一个色的颜色, 一个色的颜色, 一个色的颜色, 一个色的颜色, 一个色的颜色, 一个色的颜色, 一个色的颜色, 一个色的, 一个色的, 一个色色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的, 一个色的,</s>