3.1 Graph theory Shapes of the Future, Victor Klee, 2:2, 1971, 14-27, 0.3 Topological Regular Solids, Stewart S. Cairns, 4:1, 1973, 74-76, C Partitions of the Plane, Nathan Hoffman, 5:2, 1974, 71-73, C, 0.3 MathematicsÑIs It Any of Your Business?, Ralph Mansfield, 6:3, 1975, 20-26, 1.2, 9.1 The Game of Sprouts, Gordon D. Prichett, 7:4, 1976, 21-25, 9.2 Binary Grids and a Related Counting Problem, Nathan Hoffman, 9:4, 1978, 267-272, 6.3 The Pigeonhole Principle, Kenneth R. Rebman, 10:1, 1979, 3-13, 9.3 Who Stole the Apples and The Sticks?, Ross Honsberger, 10:1, 1979, 30-32, 3.3 The Challenge of Classifying Polyhedra, Jean J. Pedersen, 11:3, 1980, 162-173 (also 18:5, 1987, 410) An Application of Turan's Theorem, Ross Honsberger, 11:3, 1980, 196-200 On the History and Solution of the Four-Color Map Problem, John Mitchem, 12:2, 1981, 108-119. 2.2 Chain Letters: A Poor Investment Unless..., David J. Thuente, 13:1, 1982, 28-35, 7.2 Semi-Regular Lattice Polygons, Ross Honsberger, 13:1, 1982, 36-44, 9.3 Computer-Generated Knight Tours, Michael Gilpin, 13:4, 1982, 252-259, 3.3, 9.2 Labeling of Graphs, J. L. Brenner, 14:1, 1983, 36-41 Connect-It Games, Frank Harry and Robert W. Robinson, 15:5, 1984, 411-419, 9.2 Realization of Parity Visits in Walking a Graph, Robert C. Bugham and Ronald D. Dutton and Phyllis Z. Chinn and Frank Harary, 16:4, 1985, 280-282, C A Discrete Look at 1 + 2 + ... + n, Loren C. Larson, 16:5, 1985, 369-382, 0.2, 0.9, 3.2, 5.4.2, 6.3 Trees and Tennis Rankings, Curtis Cooper, 17:1, 1986, 76-78, C, 3.2 Coloring Points in the Unit Square, Charles H. Jepsen, 17:3, 1986, 231-237, 5.1.4 Combinatorics by Coin Flipping, Joel Spencer, 17:5, 1986, 407-412, 3.2, 7.2 Facility Location Problems, Fred Buckley, 18:1, 1987, 24-32, 9.10 One Factorization of Graphs: Tournament Applications, W. D. Wallis, 18:2, 1987, 116-123 How to Define an Irregular Graph, Gery Chartrand and Paul Erdos and Ortrud B. Oellermann, 19:1, 1988, 36-42 Constructing a Map from a Table of Intercity Distances, Richard J. Pulskamp, 19:2, 1988, 154-163, 4.5, 9.10 Are Graphs Finally Surfacing?, Lowell W. Beineke, 20:3, 1989, 206-225 The Number of Paths in a Rooted Binary Tree of Infinite Height, Roger H. Marty, 21:4, 1990, 305-307, C Using Euler's Formula to Solve Plane Separation Problems, Thomas L. Moore, 22:2, 1991, 125-130, 3.2 Graceful Graphs and Sparsely Marked Rulers: Student Research Projects, L. R. King and Harold B. Reiter, 22:3, 1991, 232-234 Optimal Locations, Bennett Eisenberg and Samir Khabbaz, 23:4, 1992, 282-289, 0.4, 9.9 Graphs, Matrices, and Subspaces, Gilbert Strang, 24:1, 1993, 20-28, 4.1, 4.3 The Linear Transformation Associated with a Graph: Student Research Project, Irl C. Bivens, 24:1, 1993, 76-78, 4.3, 9.1 Using PROLOG in Discrete Mathematics, Antonio M. Lopez, Jr., 24:4, 1993, 357-365, 3.4, 9.1 Independent Sets and the Golden Ratio, William Staton and Clifton Wingard, 26:4, 1995, 292-296 A Combinatorial Queueing Model, Shahar Boneh and David C. Ogden, 26:5, 1995, 346-357, 3.2 Redundancy and Reliability of Communication Networks, Ralph P. Grimaldi and Douglas R. Shier, 27:1, 1996, 59-67 The "Join the Club" Interpretation of Some Graph Algorithms, Harold Reiter and Isaac Sonin, 27:1, 1996, 54-58, C Some Graphs Whose Vertices Pair Off by Degree: Part I, Irl Bivens and Stephen L. Davis, 27:2, 1996, 127-135 Some Graphs Whose Vertices Pair Off by Degree: Part II, Irl Bivens and Stephen L. Davis, 27:3, 1996, 213-219 Colored Polygon Triangulations, Duane W. DeTemple, 29:1, 1998, 43-47, C Modeling Trees with a Stochastic Matrix, Anne M. Burns, 29:3, 1998, 230-236, 8.3 An Algorithm for Drawing the n-Cube, Van Bain, 29:4, 1998, 320-322, C FFF. Yet another refreshing induction fallacy, Shay Gueron, 31:2, 2000, 120-123, F Yet Another Refreshing Induction Fallacy, Shay Gueron, 31:3, 2000, 205-207, F, 0.9 Tree Diagram (poem), Michael Naylor, 32:3, 2001, 238, C Tiling with Dominoes, Nathan S. Mendelsohn, 35:2, 2004, 115-120, 3.2 The Growth of Trees (Student Research Projects), Philip K. Hotchkiss and John Meier, 35:2, 2004, 143-151, 9.8 The Truth about Konigsberg, Brian Hopkins and Robin J. Wilson, 35:3, 2004, 198-207 Best-Laid Plans: Pigeonhole Principle, Allen J. Schwenk, 38:1, 2007, 36, C Proof Without Words: A Graph Theoretic Summation of the First n Integers, Joe DeMaio and Joey Tyson, 38:4, 2007, C, 3.2 FFF #276. Eight is enough, I. B. Keene, 39:2, 2008, 136, F Graph Theory and Surface Reconstruction, Darren A. Narayan, 39:4, 2008, 301-303, C