Math: Combinatorics: Graph Theory
the entire directory
only this category
Advanced Search
Home
:
Math
:
Combinatorics
: Graph Theory
CATEGORIES:
Books
(9)
Events
(40)
Open Problems
(16)
People
(14)
References
(21)
LINKS:
Pages: 1
2
[>>]
A Constructive Approach to Graph Theory
http://www.hot.ee/tewet/
Notes on a semiotic approach to constructing isomorphism invariants of graphs by John-Tagore Tevet.
A Journey through Intersection Graph County
http://www.math.uni-hamburg.de/spag/gd/mitarbeiter/prisner/Pris/Rahmen.html
By Erich Prisner.
A Survey of Distance-Transitive Graphs
http://www.win.tue.nl/~amc/oz/dtg/survey.html
By Arjeh M. Cohen.
Benchmarks with Hidden Optimum Solutions for Graph Problems
http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm
Datasets in DIMACS graph format for Independent Set, Vertex Cover, Clique and Vertex Coloring problems.
Counting Hamilton Cycles in Product Graphs
http://home.planet.nl/~faase009/counting.html
By Frans Faase.
Four Colour Theorem
http://www.geocities.com/dharwadker/
A new proof of the four color theorem by Ashay Dharwadker that uses group theory and Steiner systems.
Fractal Instances of the Traveling Salesman Problem
http://www.ing.unlp.edu.ar/cetad/mos/FRACTAL_TSP_home.html
By Pablo Moscato.
From the Even Cycle Mystery to the L-Matrix Problem and Beyond
http://spider.ipac.caltech.edu/staff/brundage/presents/thesis/
By Michael Brundage.
Getgrats: General Theory of Graph Transformation Systems
http://www.di.unipi.it/~andrea/GETGRATS/
A research network funded by the European Commission.
Graph Colorings with Local Constraints
http://www.pz.zgora.pl/discuss/gt/17_2/g1.htm
A survey by Zsolt Tuza.
Graphnet Archives
http://listserv.nodak.edu/archives/graphnet.html
Archives of the Graphnet mailing list from February 1990.
Graphs: Theory-Algorithms-Complexity
http://people.freenet.de/Emden-Weinert/graphs.html
Resource collection maintained by Thomas Emden-Weinert.
Hamiltonian Circuit Algorithm
http://www.geocities.com/dharwadker/hamilton/
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.
Harmonious Colourings
http://www.mcs.dundee.ac.uk/~kedwards/harmcol.html
Notes and bibliography by Keith Edwards.
Knight's Tour Problem
http://www.tri.org.au/knightframe.html
Solution for chess boards with upto 32 squares.
Multicommodity Problems
http://www.di.unipi.it/di/groups/optimize/Data/MMCF.html
Instances and random generators of multicommodity flow and network design problems.
Network Resources for Colouring a Graph
http://mat.gsia.cmu.edu/COLOR/color.html
Resources for formulating and solving coloring problems.
Other Graph Theory and Related Pages
http://www.math.fau.edu/locke/graphoth.htm
Miscellaneous pages collected by Stephen C. Locke.
Parameters of Directed Strongly Regular Graphs
http://homepages.cwi.nl/~aeb/math/dsrg/dsrg.html
Parameters, constructions and nonexistence information for directed strongly regular graphs.
Regular Graphs Page
http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html
Tables of simple connected k-regular graphs on n vertices and girth at least g.
Sandpiles in Graphs
http://www.cs.wvu.edu/~angela/cs418a/cs418a.html
An application of cellular automata by Angela R. Kerns.
Signed, Gain and Biased Graphs
http://www.math.binghamton.edu/zaslav/Bsg/
List of publications and manuscripts annotated by Thomas Zaslavsky.
The Four Color Theorem
http://www.math.gatech.edu/~thomas/FC/fourcolor.html
Computer aided proof of the four color theorem by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas.
The Hamiltonian Page
http://www.densis.fee.unicamp.br/~moscato/Hamilton.html
Hamiltonian cycle and path problems, their generalisations and variations.
Thrackles
http://www.users.globalnet.co.uk/~perry/maths/thrackle/thrackle.htm
Jon Perry's pages on the thrackle conjecture.
Pages: 1
2
[>>]
HOME
|
ADD A LINK
|
MODIFY A LINK
|
LOGIN
© atomseek.com
Website Development by MIRO
UFO Seek Forum
is a growing community for discussion of UFO-Paranormal, mysterious and unexplained topics.