REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/17783
Pełny rekord metadanych
Pole DCWartośćJęzyk
dc.contributor.authorKoch, Sebastian-
dc.date.accessioned2025-01-09T11:31:27Z-
dc.date.available2025-01-09T11:31:27Z-
dc.date.issued2024-
dc.identifier.citationFormalized Mathematics, Volume 32, Issue 1, Pages 173–186pl
dc.identifier.issn1426-2630-
dc.identifier.urihttp://hdl.handle.net/11320/17783-
dc.description.abstractIn this article path and cycle graphs are formalized in the Mizar system.pl
dc.language.isoenpl
dc.publisherDeGruyter Openpl
dc.rightsAttribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)pl
dc.rights.urihttps://creativecommons.org/licenses/by-sa/3.0/pl
dc.subjectpath graphpl
dc.subjectcycle graphpl
dc.titleAbout Path and Cycle Graphspl
dc.typeArticlepl
dc.rights.holder© 2024 The Author(s)pl
dc.rights.holderCC BY-SA 3.0 licensepl
dc.identifier.doi10.2478/forma-2024-0014-
dc.description.AffiliationMainz, Germanypl
dc.description.referencesGrzegorz 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.referencesJohn 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.referencesRicky W. Butler and Jon A. Sjogren. A PVS graph theory library. Technical report, NASA Langley, 1998.pl
dc.description.referencesReinhard Diestel. Graph Theory, volume Graduate Texts in Mathematics; 173. Springer, Berlin, fifth edition, 2017. ISBN 978-3-662-53621-6.pl
dc.description.referencesAdam 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.referencesSebastian Koch. Introduction to graph enumerations. Formalized Mathematics, 31(1): 31–52, 2023. doi:10.2478/forma-2023-0004.pl
dc.description.referencesSebastian Koch. About supergraphs. Part I. Formalized Mathematics, 26(2):101–124, 2018. doi:10.2478/forma-2018-0009.pl
dc.description.referencesSebastian Koch. About supergraphs. Part III. Formalized Mathematics, 27(2):153–179, 2019. doi:10.2478/forma-2019-0016.pl
dc.description.referencesSebastian Koch. Refined finiteness and degree properties in graphs. Formalized Mathe matics, 28(2):137–154, 2020. doi:10.2478/forma-2020-0013.pl
dc.description.referencesSebastian Koch. About regular graphs. Formalized Mathematics, 31(1):75–86, 2023. doi:10.2478/forma-2023-0008.pl
dc.description.referencesGilbert Lee. Walks in graphs. Formalized Mathematics, 13(2):253–269, 2005.pl
dc.description.referencesGilbert Lee and Piotr Rudnicki. Alternative graph structures. Formalized Mathematics, 13(2):235–252, 2005.pl
dc.description.referencesGilbert 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.referencesLars 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.referencesRobin James Wilson. Introduction to Graph Theory. Oliver & Boyd, Edinburgh, 1972. ISBN 0-05-002534-1.pl
dc.identifier.eissn1898-9934-
dc.description.volume32pl
dc.description.issue1pl
dc.description.firstpage173pl
dc.description.lastpage186pl
dc.identifier.citation2Formalized Mathematicspl
dc.identifier.orcid0000-0002-9628-177X-
Występuje w kolekcji(ach):Formalized Mathematics, 2024, Volume 32, Issue 1

Pliki w tej pozycji:
Plik Opis RozmiarFormat 
About-Path-and-Cycle-Graphs.pdf265,22 kBAdobe PDFOtwórz
Pokaż uproszczony widok rekordu Zobacz statystyki


Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL Creative Commons