Tame Graphs

MaRDI QIDQ40292swMATHFDO

Official website https://www.isa-afp.org/entries/Flyspeck-Tame.html

Described by source

• Flyspeck I: Tame Graphs

Cited in

(21)

• Graph theory in Coq: minors, treewidth, and isomorphisms
• Flyspeck II: The basic linear programs
• The Isabelle Framework
• A formal proof of the Kepler conjecture
• A graph library for Isabelle
• The dodecahedral conjecture
• CoqJVM
• Flyspeck
• Jordan
• FinFuns
• Jinja Threads
• NASA PVS
• Native Word
• Introduction to ``Milestones in interactive theorem proving
• A formal proof of the minor-exclusion property for treewidth-two graphs
• Computational logic: its origins and applications
• A Compiled Implementation of Normalization by Evaluation
• A revision of the proof of the Kepler conjecture
• Animating the formalised semantics of a Java-like language
• Verified efficient enumeration of plane graphs modulo isomorphism
• The strong dodecahedral conjecture and Fejes Tóth's conjecture on sphere packings with kissing number twelve

This page was built for software: Tame Graphs