Logo BSU

  1. Электронная библиотека БГУ
  2. Факультет прикладной математики и информатики
  3. НАУЧНЫЕ ПУБЛИКАЦИИ ФАКУЛЬТЕТА ПРИКЛАДНОЙ МАТЕМАТИКИ И ИНФОРМАТИКИ
  4. Статьи факультета прикладной математики и информатики
Issue Date Author Title Subject
Please use this identifier to cite or link to this item: https://elib.bsu.by/handle/123456789/342247
Full metadata record
DC FieldValueLanguage
dc.contributor.authorIrzhavski, P.A.-
dc.contributor.authorOrlovich, Y.L.-
dc.date.accessioned2026-02-20T12:47:53Z-
dc.date.available2026-02-20T12:47:53Z-
dc.date.issued2020-
dc.identifier.citationDiscrete Mathematics and Applications.2020; 30(6): P. 391-408ru
dc.identifier.urihttps://elib.bsu.by/handle/123456789/342247-
dc.description.abstractA graph is called K1,p-restricted (p ≥ 3) if for every vertex of the graph there are at least p - 2 edges between any p of its neighbours. We establish sufficient conditions for the existence of a perfect matching in K1,p-restricted graphs in terms of their connectivity and vertex degrees. These conditions imply, in particular, the classical Petersen's result: any 2-edge-connected 3-regular graph contains a perfect matching.ru
dc.language.isoenru
dc.publisherBrill Academic Publishersru
dc.rightsinfo:eu-repo/semantics/openAccessru
dc.subjectЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математикаru
dc.subjectЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Кибернетикаru
dc.subjectЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Кибернетикаru
dc.titlePerfect matchings and K1,p-restricted graphsru
dc.typearticleru
dc.rights.licenseCC BY 4.0ru
dc.identifier.DOI10.1515/dma-2020-0036-
dc.identifier.orcid0000-0002-6398-8306ru
Appears in Collections:Статьи факультета прикладной математики и информатики

Files in This Item:
File Description SizeFormat 
Орлович2.pdf577,39 kBAdobe PDFView/Open
Show simple item record Google Scholar



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.