Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
33
click to vote
TPHOL
2002
IEEE
favorite
Email
discuss
report
116
views
Automated Reasoning
»
more
TPHOL 2002
»
The 5 Colour Theorem in Isabelle/Isar
14 years 3 months ago
Download
www4.in.tum.de
Based on an inductive definition of triangulations, a theory of undirected planar graphs is developed in Isabelle/HOL. The proof of the 5 colour theorem is discussed in some detail, emphasizing the readability of the computer assisted proofs.
Gertrud Bauer, Tobias Nipkow
Real-time Traffic
Automated Reasoning
|
Colour Theorem
|
Inductive Definition
|
TPHOL 2002
|
Undirected Planar Graphs
|
claim paper
Related Content
»
FreeStyle Theorem Proving
»
Properly EdgeColoured Subgraphs in Colourings of Bounded Degree
more »
Post Info
More Details (n/a)
Added
16 Jul 2010
Updated
16 Jul 2010
Type
Conference
Year
2002
Where
TPHOL
Authors
Gertrud Bauer, Tobias Nipkow
Comments
(0)
Researcher Info
Automated Reasoning Study Group
Computer Vision