Top : Science : Math : Combinatorics :
Graph Theory
Categories
| Books Events Graph Drawing @ Journals @ Open Problems People References Software @ |
Websites
Tables of simple connected k-regular graphs on n vertices and girth at least g.
http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html
Computer aided proof of the four color theorem by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas.
site exerpt
The Four Color Theorem This page gives a brief summary of a new proof of the Four Color Theorem and a four-coloring algorithm found by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas. Table of Contents: History. Why a new proof? Outline...Resource collection maintained by Thomas Emden-Weinert.
site exerpt
Graphs: Theory Algorithms Complexity This page collects information about graphs (here is a definition) and pointers to corresponding web resources. Supplementing, comments and suggestions are most welcome! Please inform me about expired links. Many thanks to Laurence Pelletier, P. Ossona de Mendez, Victor Jimenez,...An application of cellular automata by Angela R. Kerns.
site exerpt
Sandpiles in Graphs Next: Introduction: Sandpiles in Graphs Sandpiles in Graphs Angela R. Kerns Department of Statistics and Computer Science West Virginia University angela@cs.wvu.edu Introduction: Sandpiles in Graphs Cellular Automata Models of Real Sandpiles The Basic Sandpile Model The Graph Time Constraints The...Resources for formulating and solving coloring problems.
site exerpt
Network Resources for Coloring a Graph If the vertices have weights then a maximum weighted clique is a clique with the largest possible sum of vertex weights. A (vertex) coloring of an undirected graph is an assignment of a label to each node. It is required...List of publications and manuscripts annotated by Thomas Zaslavsky.
http://www.math.binghamton.edu/zaslav/Bsg/
Instances and random generators of multicommodity flow and network design problems.
site exerpt
This page provides a collection of instances and random generators of Multicommodity Flow problems. The page comprises: Linear Multicommodity Flow problems, ordinary LPs but challenging due to their size; NonLinear Multicommodity Flow problems, difficult both for their size and the...Archives of the Graphnet mailing list from February 1990.
site exerpt
Archives of GRAPHNET@LISTSERV.NODAK.EDU List Archives Subscriber's Corner Server Archives List Archives List Management List Moderation Server Management Help Log off Archive Search Archives of GRAPHNET@LISTSERV.NODAK.EDU GRAPHNET Graph Theory Search the archives Post to the list Join or leave the list (or change settings)...Miscellaneous pages collected by Stephen C. Locke.
http://www.math.fau.edu/locke/graphoth.htm
A new proof of the four color theorem by Ashay Dharwadker that uses group theory and Steiner systems.
site exerpt
Four Colour Theorem A New Proof of The Four Color Theorem by Ashay Dharwadker. Copyright (C) 2000. All rights reserved. A NEW PROOF OF THE FOUR COLOUR THEOREM...A survey by Zsolt Tuza.
site exerpt
GT 17/2 poz 1 We survey the literature on those variants of the chromatic number problem where not only a proper coloring has to be found (i.e adjacent vertices must not receive the same color) but some further local restrictions are imposed on the...By Erich Prisner.
site exerpt
Journey through Intersection Graph County The theory of intersection graphs will soon have, together with others, an own matematics subject classification number 05C62. This promotion may be mainly due to the fact that intersection graphs have nice applications some of them even originated in such...Hamiltonian cycle and path problems, their generalisations and variations.
site exerpt
The Hamiltonian Page Hamiltonian cycle and path problems, their generalizations and variations This page intends to be a comprehensive listing of papers, source code, preprints, technical reports, etc, available on the Internet about the Hamiltonian Cycle and Hamiltonian Path Problems as well as...A research network funded by the European Commission.
site exerpt
GETGRATS Home Page Click here for information about the offered grants. Deadline: OPEN Network Coordinator Team Leaders APPLIGRAPH (an ESPRIT Working Group closely related to GETGRATS) Introduction GETGRATS (General Theory of Graph Transformation Systems) is a Research TMR Network funded by the European...By Arjeh M. Cohen.
site exerpt
A Survey of Distance-Transitive Graphs This is a survey of the state of the art of the classification of primitive distance transitive graphs. It might help to carry out the remainder of the work, as sketched at the DTG workshop in Eindhoven, December 1998. The...Solution for chess boards with upto 32 squares.
http://www.tri.org.au/knightframe.html
Generates a Traveling Salesman Problem map and data for a given set of US cities.
site exerpt
Traveling Salesman Problem Generator Explanation of traveling salesman problems and methods of solving them When given a set of cities from the United States, this script will generate a map and data necessary to construct a Traveling Salesman Problem for the given set of...Notes on a semiotic approach to constructing isomorphism invariants of graphs by John-Tagore Tevet.
site exerpt
A CONSTRUCTIVE APPROACH TO GRAPH THEORY Title General Results Complementary data In German In Russian...By Pablo Moscato.
site exerpt
Fractal Instances of the Traveling Salesman Problem This page contains resources on the evolving field of the generation of instances of combinatorial optimization problems with known optimal solution. There are currently four available papers on this subject. Papers The Euclidean Traveling Salesman Problem and a Space-Filling Curve...Notes and bibliography by Keith Edwards.
site exerpt
Harmonious Colourings A vertex colouring of a graph is an assignment of colours to the vertices, with the requirement that adjacent vertices receive distinct colours. A harmonious colouring is a vertex colouring with the added requirement that each pair of colours appears...Jon Perry's pages on the thrackle conjecture.
site exerpt
Thrackles A thrackle was defined by John Conway in the late sixties. It is a graph with the property that every line in the graph intersects every other line exactly once. More information can be found at Thrackle.org An open conjecture...By Michael Brundage.
site exerpt
Thesis These pages use frames for easier navigation and a (hopefully) more attractive presentation, but your client does not support the FRAME extension to HTML. Consequently, exploring these pages may be more difficult for you (requiring lots of back"ing up Why...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.
site exerpt
Hamiltonian Circuit Algorithm A new algorithm for finding Hamiltonian circuits by Ashay Dharwadker. Copyright (C) 2004. All rights reserved. A NEW ALGORITHM FOR FINDING HAMILTONIAN CIRCUITS...By Frans Faase.
site exerpt
This page now has moved to www.iwriteiam.nl. Please follow the following link: http www.iwriteiam.nl/counting.html Please update your link, or be so kind to inform the maintainer of the refering page about the change....Parameters, constructions and nonexistence information for directed strongly regular graphs.
site exerpt
Parameters of directed strongly regular graphs Parameters of directed strongly regular graphs Sylvia A. Hobart aeb010105 We give parameters, constructions and nonexistence information for directed strongly regular graphs as defined by Duval [1 1. Definition 1.1 Hadamard matrices 1.2 The 2-dimensional case 1.3 The 1-dimensional case...These pages report the history of the TSP and ongoing work to solve large instances.
site exerpt
Traveling Salesman Problem The executable versions of the Concorde TSP code (including the Windows GUI) are built with the QSopt callable library TSP Lectures by V. Chvatal and W. Cook These pages are devoted to the history of TSP computation and to on-going...People, publications, research topics, open problems, events and resources.
site exerpt
Spectral Graph Theory ...