Flyspeck I: Tame graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4130 LNAI, Issue , 2006, Pages 21-35

  Nipkow, Tobias ^a   Bauer, Gertrud ^a   Schultz, Paula ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; INFORMATION ANALYSIS;

AUTOMATED REASONING; TAME GRAPHS;

GRAPH THEORY;

EID: 33749579435     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814771_4     Document Type: Conference Paper

References (11)

1. G. Bauer. Formalizing Plane Graph Theory - Towards a Formalized, Proof of the Kepler Conjecture. PhD thesis, Technische Universität München, 2006.
2. S. Berghofer and T. Nipkow. Executing higher order logic. In P. Callaghan, Z. Luo, J. McKinna, and R. Pollack, editors, Types for Proofs and Programs (TYPES 2000), volume 2277 of Lect. Notes in Comp. Sci., pages 24-40. Springer-Verlag, 2002.
3. G. Gonthier. A computer-checked proof of the four colour theorem. Available; at research, microsoft.com/~gonthier/4colproof.pdf.
4. T. C. Hales. Cannonballs and honeycombs. Notices Amer. Math. Soc., 47:440-449, 2000.
5. T. C. Hales. A proof of the Kepler conjecture. Annals of Mathematics, 162:1063-1183, 2005.
6. T. C. Hales. Sphere packings, VI. Tame graphs and linear programs. Discrete and Computational Geometry, 2006. To appear.
7. T. C. Hales and S. McLaughlin. A proof of the dodecahedral conjecture. E-print archive arXiv.org/abs/rnath.MG/9811079.
8. J. E. Hopcroft and J. K. Wong. Linear time algorithm for isomorphism of planar graphs (preliminary report). In STOC '74: Proc. 6th ACM Symposium Theory of Computing, pages 172-184. ACM Press, 1974.
9. T. Nipkow, L. Paulson, and M. Wenzel. Isabelle/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of Lect. Notes in Comp. Sci. Springer-Verlag, 2002. http://www.in.tum.de/~nipkow/LNCS2283/.
10. S. Obua. Proving bounds for real linear programs in Isabelle/HOL. In J. Hurd, editor, Theorem Proving in Higher Order Logics (TPHOLs 2005), volume 3603 of Lect. Notes in Comp. Sci., pages 227-244. Springer-Verlag, 2005.
11. R. Zumkeller. A formalization of global optimization with Taylor models. In Automated Reasoning (IJCAR 2006), 2006. This volume.