Niessen, T. “How to Find Overfull Subgraphs in Graphs With Large Maximum Degree, II”. The Electronic Journal of Combinatorics, Vol. 8, no. 1, Dec. 2000, p. R7, doi:10.37236/1551.