Abstract
This paper contains the informal presentation of a well known theorem on planar graphs: the theorem of Kuratowski 1930. This study is supposed to serve as an example for the proposed new discipline of Mathematical Engineering. The intend if this discipline is to show to informaticians, by means of examples, that there must exist important connections between rigorous mathematics and rigorous computer science. Moreover, in both cases, the mechanisation of proofs is becoming more and more fashionable these days. Such mechanisations cannot be performed without a clear understanding of the mathematical context that has to be rigorously described before engaging in the proof itself.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
