Tame Graphs

swMATH28578MaRDI QIDQ40292FDOQ40292

Author name not available (Why is that?)

Described by source

• Flyspeck I: Tame Graphs

Cited In (14)

• Graph theory in Coq: minors, treewidth, and isomorphisms
• Flyspeck II: The basic linear programs
• Animating the Formalised Semantics of a Java-Like Language
• The Isabelle Framework
• Verified Efficient Enumeration of Plane Graphs Modulo Isomorphism
• A graph library for Isabelle
• The dodecahedral conjecture
• 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
• The Strong Dodecahedral Conjecture and Fejes Tóth’s Conjecture on Sphere Packings with Kissing Number Twelve
• A FORMAL PROOF OF THE KEPLER CONJECTURE

This page was built for software: Tame Graphs