REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/9015
Pełny rekord metadanych
Pole DCWartośćJęzyk
dc.contributor.authorKoch, Sebastian-
dc.date.accessioned2020-04-17T08:47:17Z-
dc.date.available2020-04-17T08:47:17Z-
dc.date.issued2019-
dc.identifier.citationFormalized Mathematics, Volume 27, Issue 3, Pages 261–301pl
dc.identifier.issn1426-2630-
dc.identifier.urihttp://hdl.handle.net/11320/9015-
dc.description.abstractIn this articles adjacency-preserving mappings from a graph to another are formalized in the Mizar system [7], [2]. The generality of the approach seems to be largely unpreceeded in the literature to the best of the author’s knowledge. However, the most important property defined in the article is that of two graphs being isomorphic, which has been extensively studied. Another graph decorator is introduced as well.pl
dc.language.isoenpl
dc.publisherDeGruyter Openpl
dc.rightsUznanie autorstwa-Na tych samych warunkach 3.0 Polska*
dc.rights.urihttp://creativecommons.org/licenses/by-sa/3.0/pl/*
dc.subjectgraph homomorphismpl
dc.subjectgraph isomorphismpl
dc.titleAbout Graph Mappingspl
dc.typeArticlepl
dc.identifier.doi10.2478/forma-2019-0024-
dc.description.Emailskoch02@students.uni-mainz.depl
dc.description.AffiliationJohannes Gutenberg University, Mainz, Germanypl
dc.description.referencesGrzegorz Bancerek. Introduction to trees. Formalized Mathematics, 1(2):421–427, 1990.pl
dc.description.referencesGrzegorz Bancerek, Czesław Bylinski, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, and Karol Pak. 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 Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1): 55–65, 1990.pl
dc.description.referencesCzesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1): 153–164, 1990.pl
dc.description.referencesChristopher David Godsil and Gordon Royle. Algebraic graph theory. Graduate Texts in Mathematics; 207. Springer, New York, 2001. ISBN 0-387-95220-9; 0-387-95241-1.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.referencesPavol Hell and Jaroslav Nesetril. Graphs and homomorphisms. Oxford Lecture Series in Mathematics and Its Applications; 28. Oxford University Press, Oxford, 2004. ISBN 0-19-852817-5.pl
dc.description.referencesUlrich Huckenbeck. Extremal paths in graphs: foundations, search strategies, and related topics, volume 10 of Mathematical Topics. Akademie Verlag, Berlin, 1. edition, 1997. ISBN 3-05-501658-0; 978-3-05-501658-5.pl
dc.description.referencesTommy R. Jensen and Bjarne Toft. Graph coloring problems. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York, 1995. ISBN 0-471-02865-7.pl
dc.description.referencesUlrich Knauer. Algebraic graph theory: morphisms, monoids and matrices, volume 41 of De Gruyter Studies in Mathematics. Walter de Gruyter, 2011.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 II. Formalized Mathematics, 26(2):125–140, 2018. doi:10.2478/forma-2018-0010.pl
dc.description.referencesMike Krebs and Anthony Shaheen. Expander families and Cayley graphs: a beginners guide. Oxford University Press, Oxford, 2011. ISBN 0-19-976711-4; 978-0-19-976711-3.pl
dc.description.referencesGilbert Lee and Piotr Rudnicki. Alternative graph structures. Formalized Mathematics, 13(2):235–252, 2005.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.volume27-
dc.description.issue3-
dc.description.firstpage261pl
dc.description.lastpage301pl
dc.identifier.citation2Formalized Mathematicspl
dc.identifier.orcid0000-0002-9628-177X-
Występuje w kolekcji(ach):Formalized Mathematics, 2019, Volume 27, Issue 3

Pliki w tej pozycji:
Plik Opis RozmiarFormat 
forma_2019_27_3_0024.pdf367,91 kBAdobe PDFOtwórz
Pokaż uproszczony widok rekordu Zobacz statystyki


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