<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>In this article sets of certain subgraphs of a graph are formalized in the Mizar system [<xref ref-type="bibr" rid="j_forma-2023-0004_ref_007">7</xref>], [<xref ref-type="bibr" rid="j_forma-2023-0004_ref_001">1</xref>], based on the formalization of graphs in [<xref ref-type="bibr" rid="j_forma-2023-0004_ref_011">11</xref>] briefly sketched in [<xref ref-type="bibr" rid="j_forma-2023-0004_ref_012">12</xref>]. The main result is the spanning subgraph theorem.</p>
</abstract>

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.

Introduction to Graph Enumerations

Formalized Mathematics

This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 Public License.

{"article-title":"Introduction to Graph Enumerations"}

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

Introduction to Graph Enumerations

Online veröffentlicht: 26. Sept. 2023

Seitenbereich: 31 - 52

Akzeptiert: 31. März 2023

DOI: https://doi.org/10.2478/forma-2023-0004

Schlüsselwörter
graph enumeration, spanning tree

© 2023 Sebastian Koch, published by Sciendo

This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 Public License.

Introduction to Graph Enumerations

Online veröffentlicht: 26. Sept. 2023

Seitenbereich: 31 - 52

Akzeptiert: 31. März 2023

DOI: https://doi.org/10.2478/forma-2023-0004

Schlüsselwörtergraph enumeration, spanning tree

© 2023 Sebastian Koch, published by Sciendo

This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 Public License.

Schlüsselwörter
graph enumeration, spanning tree