REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/9016
Pełny rekord metadanych
Pole DCWartośćJęzyk
dc.contributor.authorKoch, Sebastian-
dc.date.accessioned2020-04-17T09:01:52Z-
dc.date.available2020-04-17T09:01:52Z-
dc.date.issued2019-
dc.identifier.citationFormalized Mathematics, Volume 27, Issue 3, Pages 303–313pl
dc.identifier.issn1426-2630-
dc.identifier.urihttp://hdl.handle.net/11320/9016-
dc.description.abstractIn [6] partial graph mappings were formalized in the Mizar system [3]. Such mappings map some vertices and edges of a graph to another while preserving adjacency. While this general approach is appropriate for the general form of (multidi)graphs as introduced in [7], a more specialized version for graphs without parallel edges seems convenient. As such, partial vertex mappings preserving adjacency between the mapped verticed are formalized here.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 Vertex Mappingspl
dc.typeArticlepl
dc.identifier.doi10.2478/forma-2019-0025-
dc.description.Emailskoch02@students.uni-mainz.depl
dc.description.AffiliationJohannes Gutenberg University, Mainz, Germanypl
dc.description.referencesIan Anderson. A first course in discrete mathematics. Springer Undergraduate Mathematics Series. Springer, London, 2001. ISBN 1-85233-236-0.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.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 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 graph mappings. Formalized Mathematics, 27(3):261–301, 2019. doi:10.2478/forma-2019-0024.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.firstpage303pl
dc.description.lastpage313pl
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_0025.pdf253,73 kBAdobe PDFOtwórz
Pokaż uproszczony widok rekordu Zobacz statystyki


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