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.
Spectral Graph Theory: People, publications, research topics, open problems, events and resources.
The Clique Algorithm: A polynomial-time algorithm for finding maximal cliques in a graph with new bounds on Ramsey numbers by Ashay Dharwadker.
The Four Color Theorem: Computer aided proof of the four color theorem by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas.
The Hamiltonian Page: Hamiltonian cycle and path problems, their generalisations and variations.
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.
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.
The Vertex Cover Algorithm: A polynomial-time algorithm for finding minimal vertex covers in a graph by Ashay Dharwadker.
Thrackles: Jon Perry's pages on the thrackle conjecture.
Traveling Salesman Problem: These pages report the history of the TSP and ongoing work to solve large instances.
TSP Generator: Generates a Traveling Salesman Problem map and data for a given set of US cities.
Listed links may put this banner on their website.
Help
build the largest human-edited directory on the web.