Abstract
Summary
In this article sets of certain subgraphs of a graph are formalized in the Mizar system [7], [1], based on the formalization of graphs in [11] briefly sketched in [12]. The main result is the spanning subgraph theorem.
Subject
Applied Mathematics,Computational Mathematics
Reference14 articles.
1. Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, and Karol Pąk. The role of the Mizar Mathematical Library for interactive proof development in Mizar. Journal of Automated Reasoning, 61(1):9–32, 2018. doi:10.1007/s10817-017-9440-6.
2. John Adrian Bondy and U. S. R. Murty. Graph Theory. Graduate Texts in Mathematics, 244. Springer, New York, 2008. ISBN 978-1-84628-969-9.
3. Ricky W. Butler and Jon A. Sjogren. A PVS graph theory library. Technical report, NASA Langley, 1998.
4. Ching-Tsun Chou. A formal theory of undirected graphs in higher-order logic. In Thomas F. Melham and Juanito Camilleri, editors, Higher Order Logic Theorem Proving and Its Applications, 7th International Workshop, Valletta, Malta, September 19–22, 1994, Proceedings, volume 859 of Lecture Notes in Computer Science, pages 144–157. Springer, 1994. doi:10.1007/3-540-58450-1 40.
5. Reinhard Diestel. Graph Theory, volume Graduate Texts in Mathematics; 173. Springer, Berlin, fifth edition, 2017. ISBN 978-3-662-53621-6.