Perfect matchings in graphs with prescribed local restrictions
2019 ◽
Vol 63
(4)
◽
pp. 408-420
Keyword(s):
A 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 neighbours of the vertex. In this article, new sufficient conditions for existence of a perfect matching in K1,p-restricted graphs are established. In particular, J. Petersen’s classical result that every 2-edge connected 3-regular graph contains a perfect matching follows from these conditions.
Keyword(s):
2010 ◽
Vol 19
(5-6)
◽
pp. 791-817
◽
Keyword(s):
Keyword(s):
2019 ◽
Vol 39
(1)
◽
pp. 273-292
Keyword(s):
1983 ◽
Vol 26
(2)
◽
pp. 233-240
◽
1972 ◽
Vol 18
(2)
◽
pp. 129-136
◽
2013 ◽
Vol 22
(5)
◽
pp. 783-799
◽