Thomas Niessen. How to Find overfull Subgraphs in Graphs with Large Maximum Degree. Discrete Applied Mathematics, 51(1-2):117-125, 1994. [doi]
@article{Niessen94,
title = {How to Find overfull Subgraphs in Graphs with Large Maximum Degree},
author = {Thomas Niessen},
year = {1994},
doi = {10.1016/0166-218X(94)90101-5},
url = {http://dx.doi.org/10.1016/0166-218X(94)90101-5},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Niessen94},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {51},
number = {1-2},
pages = {117-125},
}