Niessen, T. 2000. How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II. The Electronic Journal of Combinatorics. 8, 1 (Dec. 2000), R7. DOI:https://doi.org/10.37236/1551.