TY  - JOUR
AU  - Thomas Niessen
TI  - How to find overfull subgraphs in graphs with large maximum degree. II
JO  - The electronic journal of combinatorics
PY  - 2001
VL  - 8
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1551/
DO  - 10.37236/1551
ID  - 10_37236_1551
ER  -