Filling some gaps on the edge coloring problem of split graphs

Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein

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 spanning tree in w…