Verified efficient enumeration of plane graphs modulo isomorphism
From MaRDI portal
Recommendations
Cites work
- Code generation via higher-order rewrite systems
- Dense sphere packings. A blueprint for formal proofs
- Flyspeck I: Tame Graphs
- Flyspeck II: The basic linear programs
- HOL Light: An Overview
- Interpretation of Locales in Isabelle: Theories and Proof Contexts
- Isabelle/HOL. A proof assistant for higher-order logic
- Partial and nested recursive function definitions in higher-order logic
- Programming Languages and Systems
- Sphere packings. VI: Tame graphs and linear programs
- Study of the Kepler's conjecture: the problem of the closest packing
- The Isabelle collections framework
- Tutorial to locales and locale interpretation
Cited in
(7)- A proof system for graph (non)-isomorphism verification
- A formal proof of the Kepler conjecture
- Flyspeck I: Tame Graphs
- Gale-Shapley verified
- Verifying Faradžev-Read Type Isomorph-Free Exhaustive Generation
- Locales: a module system for mathematical theories
- Efficient enumeration of non-isomorphic Ptolemaic graphs
Describes a project that uses
Uses Software
This page was built for publication: Verified efficient enumeration of plane graphs modulo isomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088012)