Graph Theory, as a branch of Combinatorics, MSC classification 05Cxx.
More information
More information
Subcategories 6
Sites 13
By Emin Gabrielyan.
By Frans Faase.
A research network funded by the European Commission.
Unreviewed paper by Stephen M Kauffman.
[PDF]
Archives of the Graphnet mailing list from February 1990.
Solution for chess boards with up to 32 squares.
An approach to solve the asymmetric travelling salesman problem using linear optimisation with a polynomial bounded set of constraints.
Resources for formulating and solving coloring problems.
By Ashay Dharwadker. Includes profile, research papers for other algorithms, lecture notes, and student database.
Parameters, constructions and nonexistence information for directed strongly regular graphs.
Tables of simple connected k-regular graphs on n vertices and girth at least g.
List of publications and manuscripts annotated by Thomas Zaslavsky.
Discussion of this problem using simulated annealing. Downloadable program by Peter Meyer demonstrates solutions of the problem for particular cases.
By Ashay Dharwadker. Includes profile, research papers for other algorithms, lecture notes, and student database.
Solution for chess boards with up to 32 squares.
Unreviewed paper by Stephen M Kauffman.
[PDF]
Discussion of this problem using simulated annealing. Downloadable program by Peter Meyer demonstrates solutions of the problem for particular cases.
An approach to solve the asymmetric travelling salesman problem using linear optimisation with a polynomial bounded set of constraints.
By Frans Faase.
By Emin Gabrielyan.
A research network funded by the European Commission.
Tables of simple connected k-regular graphs on n vertices and girth at least g.
List of publications and manuscripts annotated by Thomas Zaslavsky.
Archives of the Graphnet mailing list from February 1990.
Resources for formulating and solving coloring problems.
Parameters, constructions and nonexistence information for directed strongly regular graphs.
