Formalization of Planar Graphs

@inproceedings{Yamamoto1995FormalizationOP,
  title={Formalization of Planar Graphs},
  author={Mitsuharu Yamamoto and Shin-ya Nishizaki and Masami Hagiya and Yozo Toda},
  booktitle={TPHOLs},
  year={1995}
}
Among many fields of mathematics and computer science, discrete mathematics is one of the most difficult fields to formalize because we prove theorems using intuitive inferences that have not been rigorously formalized yet. This paper focuses on graph theory from discrete mathematics and formalizes planar graphs. Although planar graphs are usually defined by embeddings into the two-dimensional real space, this definition can hardly be used for actually developing a formal theory of planar… CONTINUE READING
13 Extracted Citations
8 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-8 of 8 references

Discrete Structures. Number 3 in Information Mathematics Lectures

  • Seiya Negami
  • Kyouritsu Shuppan, Tokyo,
  • 1993

Mdham. A package for inductive relation definition in HOL

  • F. Thomas
  • In Proceedings o['the
  • 1991
1 Excerpt

The HOL sets Library

  • Thomas F. Melham
  • 1991
1 Excerpt

Graph Algorithms, volume A of Handbook of Theoretical Computer Science, chapter 10, pages 525-633

  • Jan van Leeuwen
  • 1990
1 Excerpt

Graph theory. Addison-Wesley series in mathematics

  • Frank I-Iarary
  • AddisonWesley, London,
  • 1969

Similar Papers

Loading similar papers…