An introduction to graphs and some of their applications is provided by the "This is MegaMathematics" site from Los Alamos National Laboratory at

A description of the application of graph theory to computational molecular biology can be found as part of a student project at

Graph theory lessons, based on a software system called Petersen are available at

Algorithms for drawing graphs in attractive and/or useful ways can be found at the Stony Brook Algorithm Repository, run by Steven Skiena.

Various implementations of data structures for graphs, which allow a user to create and edit graphs so that various algorithms can be run on graphs, are available at the Stony Brook Algorithm Repository, run by Steven Skiena,

Source code for algorithms for generating graphs, including generating all graphs of a certain size and generating random graphs, can be found at the Stony Brook Algorithm Repository, run by Steven Skiena.

Source code for algorithms for testing whether two graphs are isomorphic, including the NAUTY, can be found at the Stony Brook Algorithm Repository run by Steven Skiena.

Source code for algorithms for finding the connected components of a graph can be found at the Stony Brook Algorithm Repository, run by Steven Skiena.

Source code for algorithms that find Euler circuits can be found at the Stony Brook Algorithm Repository, run by Steven Skiena. (Note that the terminology used here differs from that of the text.)

A biography of Euler, and an audio file demonstrating the correct pronunciation of his name, can be found in the Historical Tidbits section of the Interactive Real Analysis. This site was prepared by Bert G. Wachsmuth at Seton Hall University.

A biographic and a portrait of Leonhard Euler can be found at the MacTutor History of Mathematics Archive at the University of St Andrews, Scotland.

The material about Euler from A Short Account of the History of Mathematics, 4^th edition, 1908) by W.W. Rouse Ball, can be found at

A biography and a photograph of Hamilton can be found at the MacTutor History of Mathematics Archive at the University of St Andrews, Scotland.

A comprehensive list of Web resources relating to Hamilton circuit and paths, including articles, technical reports and source code.

Source code for algorithms for finding Hamilton circuits can be found at the Stony Brook Algorithm Repository, run by Steven Skiena,

Consult a site develop by David Joyner and Jim McShea of the Mathematics Department of the United States Naval Academy to learn more about applications of Gray codes and to obtain software for algorithms that generate these codes.

More information about Gray codes can be found at

A biography and a photograph of Julius Petersen can be found at the MacTutor History of Mathematics Archive at the University of St Andrews, Scotland.

Source code for finding the shortest path between two vertices in a graph can be found at the Stony Brook Algorithm Repository, run by Steven Skiena.

The TSPBIB (Travelling Salesman Problem Bibliography) Home Page, created and maintained by Pablo Moscato, contains a comprehensive list of Web resources relating to the Traveling Salesman Problem (TSP) and related problems, including articles, technical reports, and source code implementing various algorithms for solving the travelling salesman problem.

Source code for solving the traveling salesman problem can also be found at the Stony Brook Algorithm Repository, run by Steven Skiena.

Section 7.7 Planar Graphs

Source code for algorithms that determine whether a graph is planar and that produce a drawing of the graph in the plane without edges crossing can be found at the Stony Brook Algorithm Repository, run by Steven Skiena.

A biography and a photograph of Kuratowski can be found at the MacTutor History of Mathematics Archive at the University of St Andrews, Scotland.

The Graph Coloring Page, created and maintained by Joseph Culberson at the University of Alberta, is an excellent resource for information, programs, and links related to graph colorings.

You can download the source code for several different graph algorithms by following the hyperlink to "Culberson’s Graph Coloring Programs" found in the "Graph Coloring Programs" section of the page.

Source code for coloring the vertices (and edges) of a graph can be found at the Stony Brook Algorithm Repository, run by Steven Skiena.

A biography and a photograph of Alfred Kempe can be found at the MacTutor History of Mathematics Archive at the University of St Andrews, Scotland.

A summary of a new proof of the Four Color Theorem and a four-coloring algorithm found by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas can be found.

Source code for finding cliques in graphs can be found at the Stony Brook Algorithm Reposity, run by Steven Skiena,

An excellent introduction to the concept of the diameter of a graph can be found at the Mathmania site at

Source code for finding the largest independent set of vertices in a graph can be found at the Stony Brook Algorithm Repository, run by Steven Skiena,

feedback form | permissions | international | locate your campus rep | request a review copy

digital solutions | publish with us | customer service | mhhe home

---

Copyright ©2001 The McGraw-Hill Companies.
Any use is subject to the Terms of Use and Privacy Policy.
McGraw-Hill Higher Education is one of the many fine businesses of the The McGraw-Hill Companies.