%0 Journal Article
%A Thomas Niessen
%T How to find overfull subgraphs in graphs with large maximum degree. II
%J The electronic journal of combinatorics
%D 2001
%V 8
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1551/
%R 10.37236/1551
%F 10_37236_1551