Hansen, Pierre How far is, should and could be conjecture-making in graph theory an automated process? (English) Zbl 1097.68588 Fajtlowicz, Siemion (ed.) et al., 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. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3761-3/hbk). DIMACS. Series in Discrete Mathematics and Theoretical Computer Science 69, 189-229 (2005). Summary: Computer-assisted and automated conjecture-making in graph theory is reviewed, focusing on the three operational Systems GRAPH, Graffiti and AutoGraphiX (AGX). A series of possible enhancements, mostly through hybridisation of these systems, are proposed as well as several research paths for development of the area.For the entire collection see [Zbl 1087.05001]. Cited in 8 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science 68T05 Learning and adaptive systems in artificial intelligence 68T15 Theorem proving (deduction, resolution, etc.) (MSC2010) 05-04 Software, source code, etc. for problems pertaining to combinatorics Software:AutoGraphiX PDFBibTeX XMLCite \textit{P. Hansen}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 69, 189--229 (2005; Zbl 1097.68588)