| Home Web Directory Metasearch Message Boards Classified Ads
|
Top: Science: Math: Combinatorics: Graph_Theory:
Graph Theory (136)
Categories:
Sites:
 |
|
» Four Colour Theorem 
A new proof of the four color theorem by Ashay Dharwadker that uses group theory and Steiner systems.
http://www.geocities.com/dharwadker/
|
 |
|
» Graphnet Archives 
Archives of the Graphnet mailing list from February 1990.
http://listserv.nodak.edu/archives/graphnet.html
|
 |
|
» Hamiltonian Circuit Algorithm 
A new algorithm for finding Hamiltonian circuits with a constructive proof of Dirac's theorem and applications to finding Knight's Tours by Ashay Dharwadker.
http://www.geocities.com/dharwadker/hamilton/
|
 |
|
» Harmonious Colourings 
Notes and bibliography by Keith Edwards.
http://www.mcs.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
|
 |
|
» 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/
|
 |
|
» 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
|
 |
|
» The Clique Algorithm 
A polynomial-time algorithm for finding maximal cliques in a graph with new bounds on Ramsey numbers by Ashay Dharwadker.
http://www.geocities.com/dharwadker/clique/
|
 |
|
» 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
|
 |
|
» The Hamiltonian Page 
Hamiltonian cycle and path problems, their generalisations and variations.
http://www.densis.fee.unicamp.br/~moscato/Hamilton.html
|
 |
|
» The Independent Set Algorithm 
A polynomial-time algorithm for finding maximal independent sets in a graph with new bounds on Ramsey numbers by Ashay Dharwadker.
http://www.geocities.com/dharwadker/independent_set/
|
 |
|
» The Vertex Coloring Algorithm 
A polynomial-time algorithm for coloring the vertices of a graph with a new constructive proof of Brooks' theorem by Ashay Dharwadker.
http://www.geocities.com/dharwadker/vertex_coloring/
|
 |
|
» The Vertex Cover Algorithm 
A polynomial-time algorithm for finding minimal vertex covers in a graph by Ashay Dharwadker.
http://www.geocities.com/dharwadker/vertex_cover/
|
 |
|
» Thrackles 
Jon Perry's pages on the thrackle conjecture.
http://www.users.globalnet.co.uk/~perry/maths/thrackle/thrackle.htm
|
 |
|
» Traveling Salesman Problem 
These pages report the history of the TSP and ongoing work to solve large instances.
http://www.tsp.gatech.edu//
|
Last Updated: 2006-09-30 13:54:56
The content of this directory is based on the Open Directory and has been modified by GoSearchFor.com
|