<abstract xmlns="http://www.w3.org/1999/xhtml"><p>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 <italic>K</italic><sub>1</sub> by applying a finite sequence of these basic operations. In this article that claim is proven explicitly with Mizar[4].</p></abstract>

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 K1 by applying a finite sequence of these basic operations. In this article that claim is proven explicitly with Mizar[4].

About Supergraphs. Part III

Formalized Mathematics

This work is licensed under a Creative Commons Attribution Share-Alike 4.0 License.

{"article-title":"About Supergraphs. Part III"}

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...

About Supergraphs. Part III

Online veröffentlicht: 20. Juli 2019

Seitenbereich: 153 - 179

Akzeptiert: 27. Mai 2019

DOI: https://doi.org/10.2478/forma-2019-0016

Schlüsselwörter
supergraph, graph operations, construction of finite graphs

© 2019 Sebastian Koch, published by Sciendo

This work is licensed under a Creative Commons Attribution Share-Alike 4.0 License.

About Supergraphs. Part III

Online veröffentlicht: 20. Juli 2019

Seitenbereich: 153 - 179

Akzeptiert: 27. Mai 2019

DOI: https://doi.org/10.2478/forma-2019-0016

Schlüsselwörtersupergraph, graph operations, construction of finite graphs

© 2019 Sebastian Koch, published by Sciendo

This work is licensed under a Creative Commons Attribution Share-Alike 4.0 License.

Schlüsselwörter
supergraph, graph operations, construction of finite graphs