×

Graphs and discovery. Proceedings of the DIMACS working group, computer-generated conjectures from graph theoretic and chemical databases, November 12–16, 2001, and DIMACS public event, graph theory day 42, November 10, 2001, Piscataway, NJ, USA. (English) Zbl 1087.05001

DIMACS. Series in Discrete Mathematics and Theoretical Computer Science 69. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3761-3/hbk). xiv, 370 p. (2005).

Show indexed articles as search result.

The articles of this volume will be reviewed individually.
Indexed articles:
Berry, Jonathan W., Considerations for future designers of general purpose graph software, 1-6 [Zbl 1097.68542]
Breimer, Eric; Goldberg, Mark; Hollinger, David; Lim, Darren, Discovering optimization algorithms through automated learning, 7-25 [Zbl 1102.68534]
Brinkmann, Gunnar; Delgado-Friedrichs, Olaf; von Nathusius, Ulrike, Numbers of faces and boundary encodings of patches, 27-38 [Zbl 1095.05036]
Cvetković, Dragoš; Simić, Slobodan, Graph theoretical results obtained by the support of the expert system “Graph” – an extended survey, 39-70 [Zbl 1108.05061]
DeLaVina, Ermelinda, Graffiti.pc: a variant of Graffiti, 71-79 [Zbl 1094.05053]
DeLaVina, Ermelinda, Some history of the development of Graffiti, 81-118 [Zbl 1096.05049]
DeLaVina, Ermelinda; Fajtlowicz, Siemion; Waller, William A., On some conjectures of Griggs and Graffiti, 119-125 [Zbl 1094.05042]
Fajtlowicz, Siemion, On the representation and characterization of fullerene C\(_{60}\), 127-135 [Zbl 1092.92049]
Graver, Jack E., The structure of fullerene signatures, 137-165 [Zbl 1093.92063]
Graver, Jack E., Catalog of all fullerenes with ten or more symmetries, 167-188 [Zbl 1094.92065]
Hansen, Pierre, How far is, should and could be conjecture-making in graph theory an automated process?, 189-229 [Zbl 1097.68588]
Hansen, Pierre; Aouchiche, Mustapha; Caporossi, Gilles; Mélot, Hadrien; Stevanović, Dragan, What forms do interesting conjectures have in graph theory?, 231-251 [Zbl 1102.68093]
Hansen, Pierre; Mélot, Hadrien, Variable neighborhood search for extremal graphs. IX: Bounding the irregularity of a graph, 253-264 [Zbl 1095.05019]
Husband, Summer M.; Husband, Christopher P.; Dean, Nathaniel; Tour, James M., Mathematics for the nanocell approach to molecular electronics, 265-286 [Zbl 1097.68533]
Kingan, R. J.; Kingan, S. R., A software system for matroids, 287-295 [Zbl 1094.05014]
Larson, C. E., A survey of research in automated mathematical conjecture-making, 297-318 [Zbl 1097.68630]
Laue, R.; Grüner, Th.; Meringer, M.; Kerber, A., Constrained generation of molecular graphs, 319-331 [Zbl 1092.92051]
Myrvold, Wendy; Prsa, Tania; Walker, Neil, A dynamic programming approach for timing and designing clique algorithms, 333-340 [Zbl 1094.05051]
Pepper, Ryan D., On new didactics of mathematics: learning graph theory via Graffiti, 341-349 [Zbl 1097.05036]
Pisanski, Tomaž; Boben, Marko; Žitnik, Arjana, Interactive conjecturing with VEGA, 351-364 [Zbl 1095.05026]
Stevanović, Dragan; Caporossi, Gilles, On the \((1,2)\)-spectral spread of fullerenes, 365-370 [Zbl 1097.05028]

MSC:

05-06 Proceedings, conferences, collections, etc. pertaining to combinatorics
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
00B25 Proceedings of conferences of miscellaneous specific interest

Software:

GRAPH
PDFBibTeX XMLCite