Thomas Niessen How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II. 2001 8 Electr. J. Comb. 1 http://www.combinatorics.org/Volume_8/Abstracts/v8i1r7.html db/journals/combinatorics/combinatorics8.html#Niessen01