Graph Theory Combinatorics Math

@Intermall

Top: Science: Math: Combinatorics: Graph_Theory:

• - Resources for formulating and solving coloring problems.
  
• - Hamiltonian cycle and path problems, their generalisations and variations.
  
• - 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.
  
• - By Frans Faase.
  
• - Computer aided proof of the four color theorem by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas.
  
• - Tables of simple connected k-regular graphs on n vertices and girth at least g.
  
• - Archives of the Graphnet mailing list from February 1990.
  
• - By Arjeh M. Cohen.
  
• - Miscellaneous pages collected by Stephen C. Locke.
  
• - Instances and random generators of multicommodity flow and network design problems.
  
• - These pages report the history of the TSP and ongoing work to solve large instances.
  
• - List of publications and manuscripts annotated by Thomas Zaslavsky.
  
• - Parameters, constructions and nonexistence information for directed strongly regular graphs.
  
• - Resource collection maintained by Thomas Emden-Weinert.
  
• - Notes on a semiotic approach to constructing isomorphism invariants of graphs by John-Tagore Tevet.
  
• - By Erich Prisner.
  
• - Generates a Traveling Salesman Problem map and data for a given set of US cities.
  
• - Jon Perry's pages on the thrackle conjecture.
  
• - An application of cellular automata by Angela R. Kerns.
  
• - A survey by Zsolt Tuza.
  
• - By Michael Brundage.
  
• - By Pablo Moscato.
  
• - Notes and bibliography by Keith Edwards.
  
• - A new proof of the four color theorem by Ashay Dharwadker that uses group theory and Steiner systems.
  
• - Datasets in DIMACS graph format for Independent Set, Vertex Cover, Clique and Vertex Coloring problems.
  
• - A research network funded by the European Commission.
  
• - Solution for chess boards with upto 32 squares.