Refined Finiteness and Degree Properties in Graphs

Koch, Sebastian

doi:10.2478/forma-2020-0013

.blurhash-client-img { display: none !important; }

Refined Finiteness and Degree Properties in Graphs

Formalized Mathematics

Volume 28 (2020): Issue 2 (July 2020)

By: Sebastian Koch

Open Access

|Jan 2021

Abstract

In this article the finiteness of graphs is refined and the minimal and maximal degree of graphs are formalized in the Mizar system [3], based on the formalization of graphs in [4].

References

[1] 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 Back to article
[2] Reinhard Diestel. Graph theory. Graduate Texts in Mathematics; 173. Springer, New York, 2nd edition, 2000. ISBN 0-387-98976-5; 0-387-98976-5.
Search in Google Scholar Back to article
[3] 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
Search in Google Scholar Back to article
[4] Gilbert Lee and Piotr Rudnicki. Alternative graph structures. Formalized Mathematics, 13(2):235–252, 2005.
Search in Google Scholar Back to article
[5] C. St. J. A. Nash-Williams. Infinite graphs – a survey. Journal of Combinatorial Theory, 3(3):286–301, 1967.10.1016/S0021-9800(67)80077-2
Search in Google Scholar Back to article
[6] Klaus Wagner. Graphentheorie. B.I-Hochschultaschenbücher; 248. Bibliograph. Inst., Mannheim, 1970. ISBN 3-411-00248-4.
Search in Google Scholar Back to article
[7] Robin James Wilson. Introduction to Graph Theory. Oliver & Boyd, Edinburgh, 1972. ISBN 0-05-002534-1.
Search in Google Scholar Back to article