 | | Home : Math : Higher Mathematics : Discrete Mathematics : Rosen, Discrete Mathematics and Its Applications, 6th Edition : Chapter 09 : Page 4 | | LINKS: |  | |
Pages: [<<] 1 2 3 4 | - Page 663 - Section 9.7
Kazimierz Kuratowski -- A biography and a photograph of Kuratowski can be found at the MacTutor History of Mathematics Archive at the University of St. Andrews, Scotland.
http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Kuratowski.html
(Added: Fri Jul 28 2006)
- Page 666 - Section 9.7 Exercises
Crossing Number -- To learn more about crossing numbers of graphs read the Wikipedia article here.
http://en.wikipedia.org/wiki/Crossing_number
(Added: Fri Jul 28 2006)
- Page 666 - Section 9.8
Graph Theory Lessons -- Graph theory lessons, based on a software system called Petersen are available at the website of Christopher Mawata at the University of Tennessee, Chattanooga who developed this system. The software can draw, edit and manipulate simple graphs, as well as examine properties of graphs, and demonstrate them using computer animation, Among topics addressed are the handshaking theorem, isomorphism of graphs, complete graphs, subgraphs, regular graphs, platonic graphs, adjacency matrices, graph coloring, bipartite graphs, simple circuits, Euler and Hamilton circuits, trees, unions and sums of graphs, complements of graphs, line graphs, spanning trees, plane graphs, shortest paths, and minimal spanning trees. To find these lessons, go here.
http://www.utc.edu/~cpmawata/petersen/
(Added: Fri Jul 28 2006)
- Page 666 - Section 9.8
Graph Coloring Page -- 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 link to "Culberson's Graph Coloring Programs" found in the "Graph Coloring Programs" section of the page.
http://www.cs.ualberta.ca/~joe/Coloring/index.html
(Added: Fri Jul 28 2006)
- Page 668 - Section 9.8
Alfred Bray Kempe -- 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.
http://www-history.mcs.st-and.ac.uk/~history/Mathematicians/Kempe.html
(Added: Fri Jul 28 2006)
- Page 668 - Section 9.8
The Four Color Theorem -- 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 here.
http://www.math.gatech.edu/~thomas/FC/fourcolor.html
(Added: Fri Jul 28 2006)
- Page 669 - Section 9.8
The Four Color Theorem -- A clear exposition of the four color theorem can be found here.
http://www.mathpages.com/home/kmath266/kmath266.htm
(Added: Fri Jul 28 2006)
- Page 669 - Section 9.8
The four colour theorem -- Information about the history of the four color theorem can
be found here.
http://www-history.mcs.st-and.ac.uk/history/HistTopics/The_four_colour_theorem.html
(Added: Fri Jul 28 2006)
- Page 669 - Section 9.8
The Four Color Theorem -- To learn more about the four color theorem and to learn about a simplified proof by Robertson, Sanders, Seymour, and Thomas, go here.
http://www.math.gatech.edu/~thomas/FC/fourcolor.html
(Added: Fri Jul 28 2006)
- Page 671 - Section 9.8
1.5.7 Vertex Coloring -- Source code for coloring the vertices of a graph can be found at the Stony Brook Algorithm Repository, run by Steven Skiena.
http://www.cs.sunysb.edu/~algorith/files/vertex-coloring.shtml
(Added: Fri Jul 28 2006)
- Page 674 - Section 9.8 Exercises
1.5.8 Edge Coloring -- Source code for coloring the edges of a graph can be found at the Stony Brook Algorithm Repository, run by Steven Skiena.
http://www.cs.sunysb.edu/~algorith/files/edge-coloring.shtml
(Added: Fri Jul 28 2006)
- Page 678 - Supplementary Exercises
1.5.1 Clique -- Source code for finding cliques in graphs can be found at the Stony Brook Algorithm Repository, run by Steven Skiena.
http://www.cs.sunysb.edu/~algorith/files/clique.shtml
(Added: Fri Jul 28 2006)
- Page 680 - Supplementary Exercise #38
Graph Diameter -- You can information about the diameter of a graph at Eric Wiesstein's World of Mathematics website here.
http://mathworld.wolfram.com/GraphDiameter.html
(Added: Fri Jul 28 2006)
- Page 680 - Supplementary Exercises
1.3.7 Generating Graphs -- 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.
http://www.cs.sunysb.edu/~algorith/files/generating-graphs.shtml
(Added: Fri Jul 28 2006)
- Page 680 - Supplementary Exercises
1.5.2 Independent Set -- 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.
http://www.cs.sunysb.edu/~algorith/files/independent-set.shtml
(Added: Fri Jul 28 2006)
| |
Pages: [<<] 1 2 3 4 | |
