Niessen, Thomas. “How to Find Overfull Subgraphs in Graphs With Large Maximum Degree, II”. The Electronic Journal of Combinatorics 8, no. 1 (December 10, 2000): #R7. Accessed May 18, 2026. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v8i1r7.