Tame Graphs
From MaRDI portal
swMATH28578MaRDI QIDQ40292FDOQ40292
Author name not available (Why is that?)
Official website: https://www.isa-afp.org/entries/Flyspeck-Tame.html
Cited In (20)
- 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
- Introduction to ``Milestones in interactive theorem proving
- Flyspeck
- A formal proof of the minor-exclusion property for treewidth-two graphs
- Jordan
- FinFuns
- Jinja Threads
- NASA PVS
- Native Word
- 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
