How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II

Thomas Niessen. How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II. Electr. J. Comb., 8(1), 2001. [doi]

@article{Niessen01,
  title = {How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II},
  author = {Thomas Niessen},
  year = {2001},
  url = {http://www.combinatorics.org/Volume_8/Abstracts/v8i1r7.html},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Niessen01},
  cites = {0},
  citedby = {0},
  journal = {Electr. J. Comb.},
  volume = {8},
  number = {1},
}