Published Online: Jul 20, 2019
Page range: 153 - 179
Accepted: May 27, 2019
DOI: https://doi.org/10.2478/forma-2019-0016
Keywords
© 2019 Sebastian Koch, published by Sciendo
This work is licensed under a Creative Commons Attribution Share-Alike 4.0 License.
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