Aouchiche, M.; Bonnefoy, J. M.; Fidahoussen, A.; Caporossi, G.; Hansen, P.; Hiesse, L.; LacherĂ©, J.; Monhait, A. Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system. (English) Zbl 1100.90052 Liberti, Leo et al., Global optimization. From theory to implementation. New York, NY: Springer (ISBN 0-387-28260-2/hbk). Nonconvex Optimization and Its Applications 84, 281-310 (2006). Summary: The AutoGraphiX (AGX) system for computer assisted or, for some of its functions, fully automated graph theory was developed at GERAD, Montreal since 1997. We report here on a new version (AGX 2) of that system. It contains many enhancements, as well as a new function for automated proof of simple propositions. Among other results, AGX 2 led to several hundred new conjectures, ranking from easy ones, proved automatically, to others requiring longer unassisted or partially assisted proofs, to open ones. Many examples are given, illustrating AGX 2’s functions and the results obtained.For the entire collection see [Zbl 1087.90005]. Cited in 5 ReviewsCited in 59 Documents MSC: 90C35 Programming involving graphs or networks 05C85 Graph algorithms (graph-theoretic aspects) 68R10 Graph theory (including graph drawing) in computer science 05C35 Extremal problems in graph theory 68T15 Theorem proving (deduction, resolution, etc.) (MSC2010) Keywords:graph theory; automated system; computer-assisted; automated proof; conjecture; refutation; AGX Software:AutoGraphiX PDFBibTeX XMLCite \textit{M. Aouchiche} et al., Nonconvex Optim. Appl. 84, 281--310 (2006; Zbl 1100.90052)