Affiliation:
1. Johannes Gutenberg University , Mainz , Germany
Abstract
Summary
The previous articles [5] and [6] introduced formalizations of the step-by-step operations we use to construct finite graphs by hand. That implicitly showed that any finite graph can be constructed from the trivial edgeless graph K
1 by applying a finite sequence of these basic operations. In this article that claim is proven explicitly with Mizar[4].
Subject
Applied Mathematics,Computational Mathematics
Reference9 articles.
1. [1] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107–114, 1990.
2. [2] Lowell W. Beineke and Robin J. Wilson, editors. Selected Topics in Graph Theory. Academic Press, London, 1978. ISBN 0-12-086250-6.
3. [3] 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.
4. [4] Adam Grabowski, Artur Korniłowicz, and Adam Naumowicz. Four decades of Mizar. Journal of Automated Reasoning, 55(3):191–198, 2015. doi:10.1007/s10817-015-9345-1.10.1007/s10817-015-9345-1
5. [5] Sebastian Koch. About supergraphs. Part I. Formalized Mathematics, 26(2):101–124, 2018. doi:10.2478/forma-2018-0009.10.2478/forma-2018-0009
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. About Graph Complements;Formalized Mathematics;2020-04-01