6533b837fe1ef96bd12a3309
RESEARCH PRODUCT
About Supergraphs. Part III
Sebastian Kochsubject
EpigraphTheoretical computer scienceApplied Mathematics68t99Part iiiComputational Mathematics03b35construction of finite graphsQA1-93905c76Graph operationssupergraphgraph operationsMathematicsMathematicsdescription
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].
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2019-07-01 | Formalized Mathematics |