NIESSEN, T. How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II. The Electronic Journal of Combinatorics, v. 8, n. 1, p. R7, 10 Dec. 2000.