Published in: Dagstuhl Seminar Proceedings, Volume 5021, Mathematics, Algorithms, Proofs (2006)
Tobias Nipkow and Gertrud Bauer. Towards a Verified Enumeration of All Tame Plane Graphs. In Mathematics, Algorithms, Proofs. Dagstuhl Seminar Proceedings, Volume 5021, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{nipkow_et_al:DagSemProc.05021.21, author = {Nipkow, Tobias and Bauer, Gertrud}, title = {{Towards a Verified Enumeration of All Tame Plane Graphs}}, booktitle = {Mathematics, Algorithms, Proofs}, pages = {1--25}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5021}, editor = {Thierry Coquand and Henri Lombardi and Marie-Fran\c{c}oise Roy}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05021.21}, URN = {urn:nbn:de:0030-drops-4343}, doi = {10.4230/DagSemProc.05021.21}, annote = {Keywords: Kepler conjecture, certified proofs, flyspeck} }
Feedback for Dagstuhl Publishing