 Mathematics Teacher: Geometry Bibliography  Hubert Ludwig
Hubert Ludwig, a math professor at Ball State University, has compiled an index of all the geometryrelated articles that appeared in the Mathematics Teacher through 1996. This page provides the index of the archive, with links to the documents in the
...more>>
 Math Exercises
Interactive exercises, lessons, and worksheets to practice knowledge of whole numbers, integers, divisibility, fractions, exponents and powers, percentages, proportional reasoning, linear equations, quadratic equations, monomials, polynomials, special
...more>>
 Math Games for Fun  Ciciu Alexandru
JavaScript games of logic, game theory, memory, and graph theory: lights off, flipping triangles, peg solitaire, place 7 balls, Nim and bogus Nim, Mastermind, the four knights, Josephus Flavius, and more. Click the "game strategy" button for hints.
...more>>
 Math Images  The Math Forum @ Drexel, the National Sciences Digital Library (NSDL), and Swarthmore College
The Math Images Project aims to
introduce the public to mathematics through beautiful and
intriguing images found throughout the fields of math. The
images feature resources around the mathematics of the images,
including discussions, applets, and
...more>>
 Math Is Power Math Puzzles  National Action Council for Minorities in Engineering (NACME)
Six Shockwave games. CodeBreaker requires using trial and error to deduce the correct string of colored circles, given feedback on position and quantity. In Space Tag, two players take turns moving on a grid, one of them attempting to occupy the other's
...more>>
 Math Problem of the Month  Dept. of Mathematics, SUNYStony Brook
A monthly competition open to all undergraduates at Stony Brook that are registered in some MAT class. Problem archives include a walk around a 3x3 board on a path that visits each square of the board once and once only; and the fourcolor map theorem.
...more>>
 The MathSite  David Gale
Hear, see, and do the pure mathematics of polygon dissections ("Dissecting Triangles and Squares") or the applied mathematics of sorting algorithms ("Sorting Bricks and Sticks"). Requires Flash and Java plugins.
...more>>
 Maths  Martin John Baker, EuclideanSpace
Originally intended to give enough maths information to allow physical objects to be simulated by a computer program, these pages now cover a broader range of mathematical topics. The pages that get the most hits on the site are those concerned with 3D
...more>>
 Math (Splines, Numerical Analysis, Graph Theory, Real Analysis)  Josh W.; Typhon Software
A collection of Java applets (may not work with older versions of Java) for investigating splines, finding roots of polynomials, manipulating matrices, drawing and analyzing graphs to study graph theory, etc.
...more>>
 Math WWW VL: Specialized Fields  Dept. of Mathematics, Florida State University
Links to sites for resources in specialized fields in collegelevel mathematics.
...more>>
 Matrix Graph Grammars  Pedro Pablo Pérez Velasco
This page is dedicated to Matrix Graph Grammars, MGG, an algebraization of graph transformation systems, a mathematical soundly based theory of computer science. In a single sentence, Matrix Graph Grammars study dynamics of graphs. Also, Matrix Graph
...more>>
 Matroids and Signed Graphs  Steven R. Pagano; Dept. of Mathematics, Univ. of Kentucky
Contents: Introduction and some notes; What is a matroid; Some common examples of matroids; Circuits, bases, rank, closure; Duality; Minors; Representability; Connectivity; What the heck is a signed graph?
...more>>
 Matroid Theory  Sandra Kingan
Matroids are an abstraction of several combinatorial objects, among them graphs and matrices. The word matroid was coined by Whitney in 1935 in his landmark paper "On the abstract properties of linear dependence." In defining a matroid Whitney tried to
...more>>
 Mega TicTacToe  Paul Nahay
A Java applet that plays TicTacToe, Connect Four, Gomoku, and hundreds of customizable original variants.
...more>>
 METIS: Family of Multilevel Partitioning Algorithms  George Karypis
A family of programs for partitioning unstructured graphs and hypergraphs and computing fillreducing orderings of sparse matrices. Includes serial and parallel graph partitioning and sparse matrix ordering and serial hypergraph partitioning.
...more>>
 Mirror Puzzles  Erich's Puzzle Palace; Erich Friedman
Each square in the grids shown contains either a person lost in the hall of mirrors, or a diagonal mirror. The numbers at the sides of the square indicate how many people can be seen from that location when looking either horizontally or vertically. The
...more>>
 Modern Math  Taoufik Nadji, Malek Physix Inc.
Mr. Taoufik Nadji's precalculus students at Interlochen Arts Academy introduce modern mathematical topics: fair division (methods: dividerchooser, lone divider, lone chooser, last diminsher, markers, sealed bids); graph theory (applications, terms,
...more>>
 The Most Colorful Math of All (MegaMath)  Nancy Casey; Los Alamos National Laboratory
Coloring is a profound mathematical topic with multimilliondollar industrial applications. The problem presented here has been of interest to mathematicians for over a hundred years. With a few crayons or markers and some handdrawn maps, children can
...more>>
 Nauty  Brendan D. McKay; Australian National University
A program for computing automorphism groups of graphs and digraphs that can also produce a canonical labelling.
...more>>
 Network Resources for Colouring a Graph  Michael Trick
A document that tries to bring together resources available on the Internet to help in formulating and solving graphcoloring problems. A Brief Survey of Applications and Algorithms (1994); Bibliographies; Solution Codes; Test Instances; People and Papers.
...more>>
 A New Proof of The Four Colour Theorem  Ashay Dharwadker
An article presenting a proof of the four color theorem that uses group theory and Steiner systems, illustrated using a map of Madhya Pradesh and adjoining states in India. Introduction; Map Colouring; Steiner Systems; Eilenberg Modules; Hall Matchings;
...more>>
 Noga Alon
Noga Alon researches combinatorics, graph theory, their applications to theoretical computer science, combinatorial geometry and number theory, and the relationship of combinatorial algorithms and circuit complexity. Some of his papers, along with a
...more>>
 Olimpíada Brasileira de Matemática  Sociedade Brasileira de Matemática (SBM)
The Olimpíada Brasileira de Matemática (OBM) is a competition open to all students enrolled in Brazil's fundamental or middle studies. Browse or download archived exam problems and solutions dating back to 1997. Read news about olympiads, or the journal
...more>>
 Open Problem Garden  Matt DeVos and Robert Šámal
A collection of unsolved problems  mainly, graph theory, combinatorics, and number theory. A wiki for each open problem includes relevant bibliographical citations, importance rating, and recommendation for undergraduates. Navigate by math subject,
...more>>
 Open Problems for Undergraduates (DIMACS)  Robert Hochberg, Center for Discrete Mathematics and Theoretical Computer Science, Rutgers Univ.
A collection of open problems in Discrete Mathematics in the areas of Graph Theory; Combinatorial Geometry; Geometry/Number theory; and Venn Diagrams, currently being researched by members of the DIMACS community. These problems are easily stated, require
...more>>
 OpsResearch  DRA Systems
A collection of Java classes for developing operations research programs and other mathematical applications. The site includes documentation and tutorials, and software download is free. Also features a bookstore and related links.
...more>>
 Party Games  Ivars Peterson (MathTrek)
You're one of six people at a dinner party. You would undoubtedly find that the dinner party includes either a group of at least three people who all know one another or a group of at least three people who don't know one another. The reason for this
...more>>
 Planarity Flash Game  John Tantalo
Arrange the vertices such that no edges overlap. Solve graphs of increasing difficulty, accumulating points based on the number of moves and the time it took to make them.
...more>>
 plantri and fullgen  Gunnar Brinkmann, University of Bielefeld, and Brendan McKay, Australian National University.
Programs for generating certain types of planar graph. Graphs are generated in such a way that exactly one member of each isomorphism class is output without the need for storing them. The speed of generation is more than 100,000 graphs per second in
...more>>
 The Problem of the Knight: A Fast and Simple Algorithm  Arnd Roth
Download a Mathematica notebook that discusses different algorithms for solving the Knight's Tour problem, finding a path for the chess knight that visits every square once. For an Introduction, Implementation, and Examples, visit Roth's MaxPlanckInstitut
...more>>
 ProblemoftheWeek  David Poole; Department of Mathematics, Trent University, Canada
Most of these problems can be done using only high school mathematics and logical reasoning. Eight problems with solutions and one without, from the fall of 1997, at Trent University, Canada. An email contact is listed, for those outside the university
...more>>
 Problems  Bojan Mohar
Conjectures in graph theory ranging from paths to colorings to matchings to crossings. With references, links to other collections of open problems, and chapters of the book that Mohar authored with Carsten Thomassen, Graphs on Surfaces.
...more>>
 Problems in Topological Graph Theory  Dan Archdeacon
An ongoing list of open questions in topological graph theory, to which the author invites contributions. Classical questions on genus; coloring graphs and maps; drawings and crossings; paths, cycles, and matchings; symmetries; locally planar embeddings;
...more>>
 Problems with a Point  Education Development Center, Inc. (EDC)
A collection of problems designed to help students in grades 612 learn new mathematical ideas by building on old ones. Varying in difficulty and approaches, these problems are useful for teachers, students, parents, math clubs, homeschoolers, and others.
...more>>
 Programs  Eight Queens / Knight's Tour  Prashant
Programs for implementing some popular algorithms from graph theory, including programs for solving Eight Queens / Knight's Tour, using Heuristics.
...more>>
 PuzzleBeast  James W. Stephens
A collection of computergenerated puzzles, some illustrated with Java applets, some with solutions included: The Fried Okra Perplexity, A Dozen Irritating Sliding Block Puzzles, The Bulbous Blob Puzzle, Meandering Monk Maze, The Kung Fu Packing Crate
...more>>
 Regular Graphs  Markus Meringer
Tables of simple connected kregular graphs on n vertices and girth at least g with given parameters n,k,g.
...more>>
 Research Group on Graph Theory and Combinatorics  Universitat Politècnica de Catalunya (UPC)
A group of about twentyfive members whose research belongs to the area, developing research projects and/or conducting works directed toward Ph.D. dissertations. Includes a searchable publication database and a page on The (Degree,Diameter) Problem for
...more>>
 Roberto Tamassia's Home Page
Home page of a Professor in the Dept. of Computer Science at Brown University. Curriculum Vitae, recent papers, teaching, books (interests include graph drawing, data structures, computational geometry).
...more>>
 Sam Speed's Home Page  Sam Speed
Using linear programs to calculate graph parameters. The adjacency number of a graph is the adjacency matrix of the graph sorted and compressed into a unique hexidecimal number. Formats: LaTeX, dvi, pdf, ps.
...more>>
 Sandpiles in Graphs  Angela R. Kerns
Research into sandpiles in graphs, related to previous research by others in several areas including include sandpiles in grids and chipfiring games; also sandpile rules as algorithms for information dissemination problems. An application of cellular
...more>>
 Septangle  Paul Nahay
Play the game, Septangle, online! Septangle is copyrighted by Dr. Paul Nahay, (DMA, Stanford University 1983).
...more>>
 Shai Simonson
Shai Simonson is an associate professor of computer science and mathematics at Stonehill College. The site contains the article "How to Read Mathematics," which uses the probability of two people having the same birthday as an example. The site also
...more>>
 The Shoelace Problem  Ivars Peterson (MathTrek)
How should shoes be laced? This seemingly simple question, rooted in everyday life, can provoke passionate argument  and evoke a mathematical response. There are at least three common ways to lace shoes, as illustrated: American (or standard) zigzag,
...more>>
 SIAM Journal on Discrete Mathematics  Society for Industrial and Applied Mathematics
A journal that publishes research articles on a broad range of topics from pure and applied mathematics, including combinatorics and graph theory, discrete optimization and operations research, theoretical computer science, to coding and communication
...more>>
 Sliders  Cut the Knot!, Alexander Bogomolny, with Don Greenwell
A variation of the Fifteen puzzle invented by Sam Loyd in the early 1870's: puzzles on graphs, including a proof independent of Wilson's theorem that all Lucky 7 permutations are possible; and variations of Sliders, a Fifteenlike puzzle that can be played
...more>>
 Soap Films and Grid Walks  Ivars Peterson (MathLand)
A simple, physical demonstration of a mathematical truth can produce a lasting impression  one that inspires new questions and speculations. For Christopher C. Chang, a student at Henry M. Gunn Senior High School in Palo Alto, Calif., and one of 40 finalists
...more>>
 Software for Algebra and Geometry Experimentation  William Stein et al.
Free and open software for researching and teaching algebra, geometry, number theory, cryptography, and more. SAGE performs group theory and combinatorics (using GAP), symbolic computation and calculus (Maxima), commutative algebra (Singular), number
...more>>
 Some Problems in Matroid Theory  Thomas Zaslavsky
Sources of problems compiled by Zaslavsky, and problems he's found interesting: Bonin's Projective Bound; Maximum rFlat; Covering And Packing by Flats. For general sources of information on matroid theory, see Matroid Miscellany.
...more>>
 Spreading Rumors  Ivars Peterson (MathLand)
Three people take longer to share their gossip than four people! This curious result arises out of the following mathematical problem: A group of friends love sharing their gossip. Each gossiper initially knows something that no one else in the group
...more>>
 
