[[1] Jesse Alama. Euler’s polyhedron formula. Formalized Mathematics, 16(1):7–17, 2008. doi:10.2478/v10037-008-0002-6.10.2478/v10037-008-0002-6]Open DOISearch in Google Scholar
[[2] Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, Karol Pąk, and Josef Urban. Mizar: State-of-the-art and beyond. In Manfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe, and Volker Sorge, editors, Intelligent Computer Mathematics, volume 9150 of Lecture Notes in Computer Science, pages 261–279. Springer International Publishing, 2015. ISBN 978-3-319-20614-1. doi:10.1007/978-3-319-20615-8_17.10.1007/978-3-319-20615-8_17]Open DOISearch in Google Scholar
[[3] 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.10.1007/s10817-017-9440-6604425130069070]Open DOISearch in Google Scholar
[[4] Lowell W. Beineke and Robin J. Wilson, editors. Selected Topics in Graph Theory. Academic Press, London, 1978. ISBN 0-12-086250-6.]Search in Google Scholar
[[5] 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.]Search in Google Scholar
[[6] Gilbert Lee. Walks in graphs. Formalized Mathematics, 13(2):253–269, 2005.]Search in Google Scholar
[[7] Gilbert Lee. Trees and graph components. Formalized Mathematics, 13(2):271–277, 2005.]Search in Google Scholar
[[8] Gilbert Lee and Piotr Rudnicki. Alternative graph structures. Formalized Mathematics, 13(2):235–252, 2005.]Search in Google Scholar
[[9] Klaus Wagner. Graphentheorie. B.I-Hochschultaschenbücher; 248. Bibliograph. Inst., Mannheim, 1970. ISBN 3-411-00248-4.]Search in Google Scholar
[[10] Robin James Wilson. Introduction to Graph Theory. Oliver & Boyd, Edinburgh, 1972. ISBN 0-05-002534-1.]Search in Google Scholar
