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