Graph Theory, as a branch of Combinatorics, MSC classification 05Cxx.

More information

More information

### Subcategories 6

### Sites 15

Capillary Multi-Path Routing in a Network of a Directed Symmetric Graph

By Emin Gabrielyan.

Counting Hamilton Cycles in Product Graphs

By Frans Faase.

The Four Color Theorem

Computer aided proof of the four color theorem by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas.

Getgrats: General Theory of Graph Transformation Systems

A research network funded by the European Commission.

Graph Theory and Linear Algebra

Unreviewed paper by Stephen M Kauffman.
[PDF]

Graphnet Archives

Archives of the Graphnet mailing list from February 1990.

Knight's Tour Problem

Solution for chess boards with up to 32 squares.

MERLIN

An approach to solve the asymmetric travelling salesman problem using linear optimisation with a polynomial bounded set of constraints.

Network Resources for Colouring a Graph

Resources for formulating and solving coloring problems.

A New Proof of the Four Colour Theorem

By Ashay Dharwadker. Includes profile, research papers for other algorithms, lecture notes, and student database.

Parameters of Directed Strongly Regular Graphs

Parameters, constructions and nonexistence information for directed strongly regular graphs.

Regular Graphs Page

Tables of simple connected k-regular graphs on n vertices and girth at least g.

Signed, Gain and Biased Graphs

List of publications and manuscripts annotated by Thomas Zaslavsky.

A Survey of Distance-Transitive Graphs

By Arjeh M. Cohen.

The Travelling Salesman Problem

Discussion of this problem using simulated annealing. Downloadable program by Peter Meyer demonstrates solutions of the problem for particular cases.

A New Proof of the Four Colour Theorem

By Ashay Dharwadker. Includes profile, research papers for other algorithms, lecture notes, and student database.

Knight's Tour Problem

Solution for chess boards with up to 32 squares.

Graph Theory and Linear Algebra

Unreviewed paper by Stephen M Kauffman.
[PDF]

The Travelling Salesman Problem

Discussion of this problem using simulated annealing. Downloadable program by Peter Meyer demonstrates solutions of the problem for particular cases.

MERLIN

An approach to solve the asymmetric travelling salesman problem using linear optimisation with a polynomial bounded set of constraints.

Counting Hamilton Cycles in Product Graphs

By Frans Faase.

A Survey of Distance-Transitive Graphs

By Arjeh M. Cohen.

Parameters of Directed Strongly Regular Graphs

Parameters, constructions and nonexistence information for directed strongly regular graphs.

Signed, Gain and Biased Graphs

List of publications and manuscripts annotated by Thomas Zaslavsky.

Graphnet Archives

Archives of the Graphnet mailing list from February 1990.

Capillary Multi-Path Routing in a Network of a Directed Symmetric Graph

By Emin Gabrielyan.

Getgrats: General Theory of Graph Transformation Systems

A research network funded by the European Commission.

Network Resources for Colouring a Graph

Resources for formulating and solving coloring problems.

Regular Graphs Page

Tables of simple connected k-regular graphs on n vertices and girth at least g.

The Four Color Theorem

Computer aided proof of the four color theorem by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas.

Copyright © 2019 Curlie.org

#HumansDoItBetter