Hardcover ISBN:  9780821837610 
Product Code:  DIMACS/69 
List Price:  $141.00 
MAA Member Price:  $126.90 
AMS Member Price:  $112.80 
eBook ISBN:  9781470440268 
Product Code:  DIMACS/69.E 
List Price:  $133.00 
MAA Member Price:  $119.70 
AMS Member Price:  $106.40 
Hardcover ISBN:  9780821837610 
eBook: ISBN:  9781470440268 
Product Code:  DIMACS/69.B 
List Price:  $274.00 $207.50 
MAA Member Price:  $246.60 $186.75 
AMS Member Price:  $219.20 $166.00 
Hardcover ISBN:  9780821837610 
Product Code:  DIMACS/69 
List Price:  $141.00 
MAA Member Price:  $126.90 
AMS Member Price:  $112.80 
eBook ISBN:  9781470440268 
Product Code:  DIMACS/69.E 
List Price:  $133.00 
MAA Member Price:  $119.70 
AMS Member Price:  $106.40 
Hardcover ISBN:  9780821837610 
eBook ISBN:  9781470440268 
Product Code:  DIMACS/69.B 
List Price:  $274.00 $207.50 
MAA Member Price:  $246.60 $186.75 
AMS Member Price:  $219.20 $166.00 

Book DetailsDIMACS  Series in Discrete Mathematics and Theoretical Computer ScienceVolume: 69; 2005; 370 ppMSC: Primary 68; 05;
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 1–7 were copublished with the Association for Computer Machinery (ACM).
ReadershipGraduate students and research mathematicians interested in using computers in graph theory.

Table of Contents

Chapters

Considerations for future designers of general purpose graph software

Discovering optimization algorithms through automated learning

Numbers of faces and boundary encodings of patches

Graph theoretical results obtained by the support of the expert system “graph”–An extended survey

Graffiti.pc: A variant of graffiti

Some history of the development of graffiti

On some conjectures of Griggs and graffiti

On the representation and characterization of fullerene C$_{60}$

The structure of fullerene signatures

Catalog of all fullerenes with ten or more symmetries

How far is, should and could be conjecturemaking in graph theory an automated process?

What forms do interesting conjectures have in graph theory?

Variable neighborhood search for extremal graphs. 9. Bounding the irregularity of a graph

Mathematics for the nanocell approach to molecular electronics

A software system for matroids

A survey of research in automated mathematical conjecturemaking

Constrained generation of molecular graphs

A dynamic programming approach for timing and designing clique algorithms

On new didactics of mathematics: Learning graph theory via graffiti

Interactive conjecturing with Vega

On the $(1,2)$spectral spread of fullerenes


RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Requests
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 1–7 were copublished with the Association for Computer Machinery (ACM).
Graduate students and research mathematicians interested in using computers in graph theory.

Chapters

Considerations for future designers of general purpose graph software

Discovering optimization algorithms through automated learning

Numbers of faces and boundary encodings of patches

Graph theoretical results obtained by the support of the expert system “graph”–An extended survey

Graffiti.pc: A variant of graffiti

Some history of the development of graffiti

On some conjectures of Griggs and graffiti

On the representation and characterization of fullerene C$_{60}$

The structure of fullerene signatures

Catalog of all fullerenes with ten or more symmetries

How far is, should and could be conjecturemaking in graph theory an automated process?

What forms do interesting conjectures have in graph theory?

Variable neighborhood search for extremal graphs. 9. Bounding the irregularity of a graph

Mathematics for the nanocell approach to molecular electronics

A software system for matroids

A survey of research in automated mathematical conjecturemaking

Constrained generation of molecular graphs

A dynamic programming approach for timing and designing clique algorithms

On new didactics of mathematics: Learning graph theory via graffiti

Interactive conjecturing with Vega

On the $(1,2)$spectral spread of fullerenes