These pages report the history of the TSP and ongoing work to solve large instances.
Tables of simple connected k-regular graphs on n vertices and girth at least g.
Computer aided proof of the four color theorem by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas.
Resource collection maintained by Thomas Emden-Weinert.
An application of cellular automata by Angela R. Kerns.
Resources for formulating and solving coloring problems.
List of publications and manuscripts annotated by Thomas Zaslavsky.
Instances and random generators of multicommodity flow and network design problems.
Archives of the Graphnet mailing list from February 1990.
Miscellaneous pages collected by Stephen C. Locke.
|