Graphs and Discovery, is in preparation as part of the American Mathematical Society Publications - DIMACS Volume Series:

Editors:

Siemion Fajtlowicz, University of Houston, math0@Bayou.UH.EDU

Patrick Fowler, University of Exeter, P.W.Fowler@exeter.ac.uk

Pierre Hansen, GERAD - Ecole des Hautes Etudes Commerciales, pierreh@crt.umontreal.ca

Melvin Janowitz, DIMACS/Rutgers University, melj@dimacs.rutgers.edu

Fred S. Roberts, DIMACS/Rutgers University, froberts@dimacs.rutgers.edu

 

Papers under consideration so far:

Some history of the development of Graffiti
     Ermelinda DeLaVinna
 
Graffiti.pc: A Variant of Grafitti
     Ermelinda DeLaVinna
 
On the representation and characterization of fullerene C60.
     Siemion Fajtlowicz
 
What forms do interesting conjectures have in Graph Theory?
     Pierre Hansen, Mustapha Aouchiche, Giles Caporossi, Dragan Stevanovic
 
How far is, could and should conjecture making be automated in graph theory?
     Pierre Hansen
 
An updated survey of research in automated mathematical conjecture-making
     Craig Larsen
 
On new didactics of mathematics - Learning graph theory via grafitti
     Ryan Pepper
 
On some conjectures of Griggs and Graffiti
     Ermlinda DeLaVinna, Siemion Fajtlowicz and Bill Waller
 
Postscript on fully automated segments of graph theory
     Siemion Fajtlowitz
 
The structure of Fullerene signatures
     Jack Graver
 
The catalog of all Fullerenes with 10 or more symmetries
     Jack Graver
 
Mathematics for the Nanocell approach to molecular electronics
     Summer Husband, Christopher Husband, Nathaniel Dean and James Tour
 
Constrained generation of molecular graphs
     R. Laue, Th Gruner, M. Meringer and A. Kerber
 
Interactive conjecturing with Vega
     T. Pisanski, M. Boben and A. Zitnik
 
Discovering automated algorithms through automated learning
     E. Breimer, M. Goldberg, D. Hollinger and D. Lin
 
Considerations for future designers of general purpose graph software
     J. Berry
 
On the (1,2)-spectral spread of fullerenes
     Dragan Stevanovic and Gilles Caporossi
 
Variable neighborhood search for extremal graphs 9. Bounding the irregularity of a graph
     Pierre Hansen

 


 

Ordering Information (when the Volume becomes available):

These books may be obtained from the AMS or through bookstores in your area. DIMACS does not distribute or sell these books.

To order through AMS contact the AMS Customer Services Department, P.O. Box 6248, Providence, Rhode Island 02940-6248 USA. For Visa, Mastercard, Discover, and American Express orders call 1-800-321-4AMS.

You may also visit the AMS Bookstore and order directly from there

 


This material is based upon work supported by the National Science Foundation under Grant No. 0100921