Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/8134
Pełny rekord metadanych
Pole DC | Wartość | Język |
---|---|---|
dc.contributor.author | Koch, Sebastian | - |
dc.date.accessioned | 2019-07-29T08:28:49Z | - |
dc.date.available | 2019-07-29T08:28:49Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | Formalized Mathematics, Volume 27, Issue 2, Pages 153 - 179 | - |
dc.identifier.issn | 1426-2630 | - |
dc.identifier.uri | http://hdl.handle.net/11320/8134 | - |
dc.description.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]. | - |
dc.language.iso | en | - |
dc.publisher | DeGruyter Open | - |
dc.subject | supergraph | - |
dc.subject | graph operations | - |
dc.subject | construction of finite graphs | - |
dc.subject | 05C76 | - |
dc.subject | 68T99 | - |
dc.subject | 03B35 | - |
dc.title | About Supergraphs. Part III | - |
dc.type | Article | - |
dc.identifier.doi | 10.2478/forma-2019-0016 | - |
dc.description.Email | skoch02@students.uni-mainz.de | - |
dc.description.Affiliation | Johannes Gutenberg University, Mainz, Germany | - |
dc.description.references | Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107–114, 1990. | - |
dc.description.references | Lowell W. Beineke and Robin J. Wilson, editors. Selected Topics in Graph Theory. Academic Press, London, 1978. ISBN 0-12-086250-6. | - |
dc.description.references | 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. | - |
dc.description.references | 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. | - |
dc.description.references | Sebastian Koch. About supergraphs. Part I. Formalized Mathematics, 26(2):101–124, 2018. doi:10.2478/forma-2018-0009. | - |
dc.description.references | Sebastian Koch. About supergraphs. Part II. Formalized Mathematics, 26(2):125–140, 2018. doi:10.2478/forma-2018-0010. | - |
dc.description.references | Gilbert Lee and Piotr Rudnicki. Alternative graph structures. Formalized Mathematics, 13(2):235–252, 2005. | - |
dc.description.references | Klaus Wagner. Graphentheorie. B.I-Hochschultaschenbücher; 248. Bibliograph. Inst., Mannheim, 1970. ISBN 3-411-00248-4. | - |
dc.description.references | Robin James Wilson. Introduction to Graph Theory. Oliver & Boyd, Edinburgh, 1972. ISBN 0-05-002534-1. | - |
dc.identifier.eissn | 1898-9934 | - |
dc.description.volume | 27 | - |
dc.description.issue | 2 | - |
dc.description.firstpage | 153 | - |
dc.description.lastpage | 179 | - |
dc.identifier.citation2 | Formalized Mathematics | - |
dc.identifier.orcid | 0000-0002-9628-177X | - |
Występuje w kolekcji(ach): | Formalized Mathematics, 2019, Volume 27, Issue 2 |
Pliki w tej pozycji:
Plik | Opis | Rozmiar | Format | |
---|---|---|---|---|
forma_2019_27_2_007.pdf | 294,42 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL