REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/10833
Pełny rekord metadanych
Pole DCWartośćJęzyk
dc.contributor.authorKoch, Sebastian-
dc.date.accessioned2021-05-04T08:01:11Z-
dc.date.available2021-05-04T08:01:11Z-
dc.date.issued2020-
dc.identifier.citationFormalized Mathematics, Volume 28, Issue 2, Pages 155-171pl
dc.identifier.issn1426-2630-
dc.identifier.urihttp://hdl.handle.net/11320/10833-
dc.description.abstractIn this article the union and intersection of a set of graphs are formalized in the Mizar system [5], based on the formalization of graphs in [7].pl
dc.language.isoenpl
dc.publisherDeGruyter Openpl
dc.rightsAttribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)-
dc.subjectgraph theorypl
dc.subjectgraph unionpl
dc.subjectgraph intersectionpl
dc.titleAbout Graph Unions and Intersectionspl
dc.typeArticlepl
dc.rights.holder© 2020 University of Białymstoku;-
dc.rights.holderCC-BY-SA License ver. 3.0 or later;-
dc.identifier.doi10.2478/forma-2020-0014-
dc.description.Emailskoch02@students.uni-mainz.depl
dc.description.AffiliationJohannes Gutenberg University, Mainz, 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.referencesCzesław Byliński. Partial functions. Formalized Mathematics, 1(2):357–367, 1990.pl
dc.description.referencesReinhard Diestel. Graph theory. Graduate Texts in Mathematics; 173. Springer, New York, 2nd edition, 2000. ISBN 0-387-98976-5; 0-387-98976-5.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. About graph complements. Formalized Mathematics, 28(1):41–63, 2020. doi:10.2478/forma-2020-0004.pl
dc.description.referencesGilbert Lee and Piotr Rudnicki. Alternative graph structures. Formalized Mathematics, 13(2):235–252, 2005.pl
dc.description.referencesKenneth H. Rosen, editor. Handbook of discrete and combinatorial mathematics. Discrete mathematics and its applications. CRC Press, Boca Raton, second edition, 2018. ISBN 978-1-58488-780-5.pl
dc.description.referencesKlaus Wagner. Graphentheorie. B.I-Hochschultaschenbücher; 248. Bibliograph. Inst., Mannheim, 1970. ISBN 3-411-00248-4.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.volume28pl
dc.description.issue2pl
dc.description.firstpage155pl
dc.description.lastpage171pl
dc.identifier.citation2Formalized Mathematicspl
dc.identifier.orcid0000-0002-9628-177X-
Występuje w kolekcji(ach):Formalized Mathematics, 2020, Volume 28, Issue 2

Pliki w tej pozycji:
Plik Opis RozmiarFormat 
10.2478_forma-2020-0014.pdf277,12 kBAdobe PDFOtwórz
Pokaż uproszczony widok rekordu Zobacz statystyki


Pozycja jest chroniona prawem autorskim (Copyright © Wszelkie prawa zastrzeżone)