 |
 | - The Four Color Theorem
- Computer aided proof of the four color theorem by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas.
http://www.math.gatech.edu/~thomas/FC/fourcolor.html
|
 | - Graphnet Archives
- Archives of the Graphnet mailing list from February 1990.
http://listserv.nodak.edu/archives/graphnet.html
|
 | - The Hamiltonian Page
- Hamiltonian cycle and path problems, their generalisations and variations.
http://www.densis.fee.unicamp.br/~moscato/Hamilton.html
|
 | - Harmonious Colourings
- Notes and bibliography by Keith Edwards.
http://www.maths.dundee.ac.uk/~kedwards/harmcol.html
|
 | - Knight's Tour Problem
- Solution for chess boards with upto 32 squares.
http://www.tri.org.au/knightframe.html
|
 | - MERLIN
- An approach to solve the asymmetric travelling salesman problem using linear optimisation with a polynomial bounded set of constraints.
http://www.merlins-world.de
|
 | - Multicommodity Problems
- Instances and random generators of multicommodity flow and network design problems.
http://www.di.unipi.it/di/groups/optimize/Data/MMCF.html
|
 | - Regular Graphs Page
- Tables of simple connected k-regular graphs on n vertices and girth at least g.
http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html
|
 | - Sandpiles in Graphs
- An application of cellular automata by Angela R. Kerns.
http://www.cs.wvu.edu/~angela/cs418a/cs418a.html
|
 | - Spectral Graph Theory
- People, publications, research topics, open problems, events and resources.
http://www.sgt.pep.ufrj.br/
|
 | - Traveling Salesman Problem
- These pages report the history of the TSP and ongoing work to solve large instances.
http://www.tsp.gatech.edu//
|
 | - TSP Generator
- Generates a Traveling Salesman Problem map and data for a given set of US cities.
http://www.sju.edu/~sforman/research/usa_tsp.html
|
|