A website directory and metasearch engine of Top 20 best websites
Top 20  
Online  
 
 
Add To Favorites Make this your Start Page Top 20 from A-Z
 
Top 20 Directory
Listen to Music Now
 Classical
 Country    Jazz
 Oldies    Top 40
 Ambient    NPR
AccuRadio
Windows  |   Launch
Radio Tower  |  AOL

Top20Listen

Local Google Maps Y! AOL City Search Ticket Master Zip Phone/E-Mail
Top 20 City Guides Top 20 State Guides Top 20 Nation Guides
Metasearch Links:   
Google Yahoo MSN Ask Answers ixquick DMOZ About
Wikipedia Encarta Y! News Y! Video AV Images Blogs Top 20
 
See also Hakia Sidekiq Clusty Other Images Google ASK Flickr News Google NYT BBC
Directories Y! Google Alexa Almanac Archive Videos Google YouTube AOL MSN ASK
 
Diversions
of the week
Food Trivia
Shark vs Octopus
Harvesting Seeds
Human Mirror
Bad Apple Game
Archive

Top20Diversions

 
Top 20 Directory:
Top : Science : Math : Combinatorics : Graph_Theory
  • Books
  • Events
  • Graph Drawing@
  • Journals@
  • Open Problems
  • People
  • References
  • Software@

    Sites:
  • A Constructive Approach to Graph Theory: Notes on a semiotic approach to constructing isomorphism invariants of graphs by John-Tagore Tevet.
  • A Survey of Distance-Transitive Graphs: By Arjeh M. Cohen.
  • Capillary Multi-Path Routing in a Network of a Directed Symmetric Graph: By Emin Gabrielyan.
  • Counting Hamilton Cycles in Product Graphs: By Frans Faase.
  • Four Colour Theorem: A new proof of the four color theorem by Ashay Dharwadker that uses group theory and Steiner systems.
  • Fractal Instances of the Traveling Salesman Problem: By Pablo Moscato.
  • From the Even Cycle Mystery to the L-Matrix Problem and Beyond: By Michael Brundage.
  • Getgrats: General Theory of Graph Transformation Systems: A research network funded by the European Commission.
  • Graph Colorings with Local Constraints: A survey by Zsolt Tuza.
  • Graphnet Archives: Archives of the Graphnet mailing list from February 1990.
  • Graphs: Theory-Algorithms-Complexity: Resource collection maintained by Thomas Emden-Weinert.
  • 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.
  • Harmonious Colourings: Notes and bibliography by Keith Edwards.
  • Knight's Tour Problem: Solution for chess boards with upto 32 squares.
  • Liquid Schedule Construction Algorithm: An efficient method for coloring a congestion graph by Emin Gabrielyan.
  • Multicommodity Problems: Instances and random generators of multicommodity flow and network design problems.
  • Network Resources for Colouring a Graph: Resources for formulating and solving coloring problems.
  • Other Graph Theory and Related Pages: Miscellaneous pages collected by Stephen C. Locke.
  • 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.
  • Sandpiles in Graphs: An application of cellular automata by Angela R. Kerns.
  • Signed, Gain and Biased Graphs: List of publications and manuscripts annotated by Thomas Zaslavsky.
  • 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.
    Submit a Site  -  Open Directory Project  -  Become an Editor
    Terms and Conditions
    About Us
    Privacy Policy

    Processing Time: 0.02