Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/15403
Pełny rekord metadanych
Pole DC | Wartość | Język |
---|---|---|
dc.contributor.author | Koch, Sebastian | - |
dc.date.accessioned | 2023-10-09T10:57:31Z | - |
dc.date.available | 2023-10-09T10:57:31Z | - |
dc.date.issued | 2023 | - |
dc.identifier.citation | Formalized Mathematics, Volume 31, Issue 1, Pages 31-52 | pl |
dc.identifier.issn | 1426-2630 | - |
dc.identifier.uri | http://hdl.handle.net/11320/15403 | - |
dc.description.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. | pl |
dc.language.iso | en | pl |
dc.publisher | DeGruyter Open | pl |
dc.rights | Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0) | pl |
dc.rights.uri | https://creativecommons.org/licenses/by-sa/3.0/ | pl |
dc.subject | graph enumeration | pl |
dc.subject | spanning tree | pl |
dc.title | Introduction to Graph Enumerations | pl |
dc.type | Article | pl |
dc.rights.holder | © 2023 The Author(s) | pl |
dc.rights.holder | CC BY-SA 3.0 license | pl |
dc.identifier.doi | 10.2478/forma-2023-0004 | - |
dc.description.Affiliation | Mainz, Germany | pl |
dc.description.references | Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, and Karol Pąk. The role of the Mizar Mathematical Library for interactive proof development in Mizar. Journal of Automated Reasoning, 61(1):9–32, 2018. doi:10.1007/s10817-017-9440-6. | pl |
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. | pl |
dc.description.references | Ricky W. Butler and Jon A. Sjogren. A PVS graph theory library. Technical report, NASA Langley, 1998. | pl |
dc.description.references | Ching-Tsun Chou. A formal theory of undirected graphs in higher-order logic. In Thomas F. Melham and Juanito Camilleri, editors, Higher Order Logic Theorem Proving and Its Applications, 7th International Workshop, Valletta, Malta, September 19–22, 1994, Proceedings, volume 859 of Lecture Notes in Computer Science, pages 144–157. Springer, 1994. doi:10.1007/3-540-58450-1_40. | pl |
dc.description.references | Reinhard Diestel. Graph Theory, volume Graduate Texts in Mathematics; 173. Springer, Berlin, fifth edition, 2017. ISBN 978-3-662-53621-6. | pl |
dc.description.references | Jessica Enright and Piotr Rudnicki. Helly property for subtrees. Formalized Mathematics, 16(2):91–96, 2008. doi:10.2478/v10037-008-0013-3. | pl |
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. | pl |
dc.description.references | Sebastian Koch. Miscellaneous graph preliminaries. Part I. Formalized Mathematics, 29 (1):21–38, 2021. doi:10.2478/forma-2021-0003. | pl |
dc.description.references | Sebastian Koch. Underlying simple graphs. Formalized Mathematics, 27(3):237–259, 2019. doi:10.2478/forma-2019-0023. | pl |
dc.description.references | Sebastian Koch. About graph sums. Formalized Mathematics, 29(4):249–278, 2021. doi:10.2478/forma-2021-0023. | pl |
dc.description.references | Gilbert Lee and Piotr Rudnicki. Alternative graph structures. Formalized Mathematics, 13(2):235–252, 2005. | pl |
dc.description.references | Gilbert Lee and Piotr Rudnicki. Alternative aggregates in Mizar. In Manuel Kauers, Manfred Kerber, Robert Miner, and Wolfgang Windsteiger, editors, Towards Mechanized Mathematical Assistants, pages 327–341, Berlin, Heidelberg, 2007. Springer Berlin Heidelberg. ISBN 978-3-540-73086-6. doi:10.1007/978-3-540-73086-6_26. | pl |
dc.description.references | Lars Noschinski. A graph library for Isabelle. Mathematics in Computer Science, 9(1): 23–39, 2015. doi:10.1007/s11786-014-0183-z. | pl |
dc.description.references | Robin James Wilson. Introduction to Graph Theory. Oliver & Boyd, Edinburgh, 1972. ISBN 0-05-002534-1. | pl |
dc.identifier.eissn | 1898-9934 | - |
dc.description.volume | 31 | pl |
dc.description.issue | 1 | pl |
dc.description.firstpage | 31 | pl |
dc.description.lastpage | 52 | pl |
dc.identifier.citation2 | Formalized Mathematics | pl |
dc.identifier.orcid | 0000-0002-9628-177X | - |
Występuje w kolekcji(ach): | Formalized Mathematics, 2023, Volume 31, Issue 1 |
Pliki w tej pozycji:
Plik | Opis | Rozmiar | Format | |
---|---|---|---|---|
10.2478_forma-2023-0004.pdf | 296,36 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL