DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 2005; 370 pp; hardcover Volume: 69 ISBN10: 0821837613 ISBN13: 9780821837610 List Price: US$120 Member Price: US$96 Order Code: DIMACS/69
 This volume presents topics addressed at the working group meeting and workshop on Computergenerated Conjectures from Graph Theoretic and Chemical Databases held at Rutgers University (Piscataway, NJ). The events brought together theoreticians and practitioners working in graph theory and chemistry to share ideas and to set an agenda for future developments in the use of computers for generating scientific conjectures. Articles included in the volume were written by developers of some of the most important programs used around the world today. The disciplines represented include theoretical and applied computer science, statistics, discrete and nondiscrete mathematics, chemistry, and information science. The book is suitable for researchers and students interested in the use of computers in graph theory. Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 17 were copublished with the Association for Computer Machinery (ACM). Readership Graduate students and research mathematicians interested in using computers in graph theory. Table of Contents  J. W. Berry  Considerations for future designers of general purpose graph software
 E. Breimer, M. Goldberg, D. Hollinger, and D. Lim  Discovering optimization algorithms through automated learning
 G. Brinkmann, O. DelgadoFriedrichs, and U. von Nathusius  Numbers of faces and boundary encodings of patches
 D. Cvetković and S. Simić  Graph theoretical results obtained by the support of the expert system "graph"An extended survey
 E. DeLaVina  Graffiti.pc: A variant of graffiti
 E. DeLaVina  Some history of the development of graffiti
 E. DeLaVina, S. Fajtlowicz, and W. Waller  On some conjectures of Griggs and graffiti
 S. Fajtlowicz  On the representation and characterization of fullerene C\(_{60}\)
 J. E. Graver  The structure of fullerene signatures
 J. E. Graver  Catalog of all fullerenes with ten or more symmetries
 P. Hansen  How far is, should and could be conjecturemaking in graph theory an automated process?
 P. Hansen, M. Aouchiche, G. Caporossi, H. Mélot, and D. Stevanović  What forms do interesting conjectures have in graph theory?
 P. Hansen and H. Mélot  Variable neighborhood search for extremal graphs. 9. Bounding the irregularity of a graph
 S. M. Husband, C. P. Husband, N. Dean, and J. M. Tour  Mathematics for the nanocell approach to molecular electronics
 R. J. Kingan and S. R. Kingan  A software system for matroids
 C. E. Larson  A survey of research in automated mathematical conjecturemaking
 R. Laue, T. Grüner, M. Meringer, and A. Kerber  Constrained generation of molecular graphs
 W. Myrvold, T. Prsa, and N. Walker  A dynamic programming approach for timing and designing clique algorithms
 R. D. Pepper  On new didactics of mathematics: Learning graph theory via graffiti
 T. Pisanski, M. Boben, and A. Žitnik  Interactive conjecturing with Vega
 D. Stevanović and G. Caporossi  On the \((1,2)\)spectral spread of fullerenes
