Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Tame Graphs

From MaRDI portal
Software:40292
Jump to:navigation, search



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
  • The Isabelle Framework
  • 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
  • Animating the formalised semantics of a Java-like language
  • A FORMAL PROOF OF THE KEPLER CONJECTURE
  • 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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Software:40292&oldid=29505396"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 March 2024, at 20:46. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki