Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures

Discrete Mathematics

Volumn 276, Issue 1-3, 2004, Pages 81-94

  Caporossi, Gilles ^a   Hansen, Pierre ^a  

^a HEC MONTRÉAL   (Canada)

Author keywords

Automated system; Conjecture; Graph

Indexed keywords

ALGEBRA; AUTOMATION; COMPUTATIONAL METHODS; COMPUTER AIDED ANALYSIS; DATABASE SYSTEMS; HEURISTIC METHODS; THEOREM PROVING; TREES (MATHEMATICS); WEBSITES;

AUTOMATED CONJENCTURES; FOUR COLOR THEOREM; VARIABLE NEIGHBORHOOD SEARCH;

GRAPH THEORY;

EID: 0346785310     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(03)00311-X     Document Type: Conference Paper

References (39)

1. F. Allaire, Another proof of the four-color theorem, in: Proceedings of the Seventh Manitoba Conference on Numerical Mathematics and Computing, 1977, Congressus Numerantium XX, Utilitas Math., Winnipeg, 1978, pp. 3-72.
2. Appel K., Haken W. Every planar map is four colorable. Part i. Discharging. Illinois J. Math. 21:1977;429-490.
3. Appel K., Haken W. Every planar map is four colorable. Part ii. Reducibility. Illinois J. Math. 21:1977;491-567.
4. Appel K., Haken W. Every planar map is four colorable. A.M.S. Contemp. Math. 98:1989;1-743.
5. Archimedes, The method of mechanical theorem proving, cited by J. Gray in "Sale of the Century?", Math. Intell. 21 (1999) 12-15.
6. Brigham R.C., Dutton R.D. Ingrid. a software tool for extremal graph theory research Congr. Numer. 39:1983;337-352.
7. Brigham R.C., Dutton R.D. A compilation of relations between graphs invariants. Networks. 15:1985;73-107.
8. Brigham R.C., Dutton R.D. A compilation of relations between graphs invariants. Networks. 21(suppl. 1):1991;421-455.
9. Brigham R.C., Dutton R.D., Gomez F. Ingrid. a graph invariant manipulator J. Symbolic Comput. 7:1989;163-177.
10. Brinkmann G. Fast generation of cubic graphs. J. Graph Theory. 23:1996;139-149.
11. Caporossi G., Cvetković D., Gutman I., Hansen P. Variable neighborhood search for extremal graphs. 2. Finding graphs with extremal energy. J. Chem. Inform. Comp. Sci. 39:1999;984-996.
12. Caporossi G., Dobrynin A.A., Gutman I., Hansen P. Trees with palindromic Hosoya polynomials. Graph Theory Notes of New York. 37:1999;10-16.
13. Caporossi G., Gutman I., Hansen P. Variable neighborhood search for extremal graphs. 4. Chemical trees with extremal connectivity index. Comp. Chem. 23:1999;469-477.
14. G. Caporossi, P. Hansen, Finding relations in polynomial time, in: Proceedings of the XVI International Joint Conference on Artificial Intelligence, 1999, pp. 780-785.
15. Caporossi G., Hansen P. Variable neighborhood search for extremal graphs. 1. The AutoGraphiX system. Discrete Math. 212:2000;29-44.
16. Cvetković D. Discussing graph theory with a computer, ii: Theorems suggested by the computer. Publ. Inst. Math. Beograd. 47:1983a;29-33.
17. Cvetković D. Discussing graph theory with a computer, iii: Man-machine theorem proving. Publ. Inst. Math. Beograd. 48:1983b;37-47.
18. D. Cvetković, Discussing graph theory with a computer, iv: Knowledge organization and examples of theorem proving, Proceedings of the Fourth Yugoslav Seminar on Graph Theory, Novi Sad, 1983, pp. 43-68.
19. D. Cvetković, L.L. Kraus, S.K. Simić, Discussing graph theory with a computer, i: Implementation of graph theoretic algorithms, Univ. Beograd Publ. Elektrotehn. Fak. 1981, pp. 100-104.
20. Cvetković D., Pevac I. Man-machine theorem proving in graph theory. Artif. Intell. 35:1988;1-23.
21. Cvetković D., Simić S.K. Graph theoretical results obtained by the support of the expert system "Graph" Bull. Acad. Serb. Sci. Arts. Cl. Sin. Matur, Sci. Math. 107(19):1994;19-41.
22. Cvetković D., Simić S., Caporossi G., Hansen P. Variable neighborhood search for extremal graphs. 3. On the largest eigenvalue of color-constrained trees. Linear Multilinear Algebra. 49:2001;143-160.
23. E. De la Vina, Bibliography on conjectures of Graffiti, http://cms.dt.uh.edu/faculty/delavinae/research/wowref.htm, 2000.
24. Fajtlowicz S. On conjectures of Graffiti - ii. Congr. Numer. 60:1987;187-197.
25. Fajtlowicz S. On conjectures of Graffiti. Discrete Math. 72:1988a;113-118.
26. Fajtlowicz S. On conjectures of Graffiti - iii. Congr. Numer. 66:1988b;23-32.
27. Fajtlowicz S. On conjectures of Graffiti - iv. Congr. Numer. 70:1990;231-240.
28. S. Fajtlowicz, On conjectures of graffiti - v, in: Seventh International Quadrennial Conference on Graph Theory, Vol. 1, 1995, pp. 367-376.
29. S. Fajtlowicz, Written on the wall. version 09-2000 (regularly updated file accessible via e-mail from clarson@math.uh.edu), 2000.
30. T. Fowler, Unique coloring of planar graphs, Ph.D. Thesis, Georgia Institute of Technology, 1998.
31. Gutman I., Miljković O. Molecules with smallest connectivity index. Match. 41:2000;57-70.
32. Gutman I., Miljković O., Caporossi G., Hansen P. Alkanes with small and large connectivity index. Chem. Phys. Lett. 306:1999;366-372.
33. O. Hudry, Le problème des quatres couleurs, in: M. Serfati (Ed.), La recherche de la vérité, Les éditions du Kangourou, 1999, pp. 211-240 (Chapter VII).
34. C.E. Larson, Intelligent machinery and mathematical discovery, available at http://math.uh.edu/̃clarson, 1999.
35. B.D. McKay, Nauty user's guide (version 1.5), Technical Report. TR-CS-90-02, Department of Computer Science, Australian National University, 1990.
36. McKay B.D. Isomorph-free exhaustive generation. J. Algorithms. 26:1998;306-324.
37. Piwakowski K., Radziszowski S.P., Urbański S. Computation of the folkman number fe(3,3;5). J. Graph Theory. 32:1999;41-49.
38. F. Pujol, étude de conjectures en théorie des graphes, Rapport de stage, GERAD, 1998.
39. Robertson N., Sanders D., Seymour P., Thomas R. The four-colour theorem. J. Combin. Theory, Ser. B. 70:1997;2-44.