Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Thomas Niessen. How to Find overfull Subgraphs in Graphs with Large Maximum Degree. Discrete Applied Mathematics, 51(1-2):117-125, 1994. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, IIThomas Niessen. combinatorics, 8(1), 2001. [doi]
The following publications are possibly variants of this publication: