AbstractWe prove the following: (1) Let G be a graph with a 1-factor and let F be an arbitrary 1-factor of G. If G⧹{a,b} is k-extendable for each ab∈F, then G is k-extendable. (2) Let G be a graph and let M be an arbitrary maximal matching of G. If G⧹{a,b} is k-factor-critical for each ab∈M, then G is k-factor-critical
AbstractGallai and Edmonds independently obtained a canonical decomposition of graphs in terms of th...
Let G be a simple connected graph on 2n vertices with a perfect matching. For 1 ≤ k ≤ n - 1, G is sa...
summary:Let $GP(n,k)$ be a generalized Petersen graph with $(n,k)=1$, $ n>k\geq4.$ Then every pair o...
AbstractA graph G of even order is said to be k-extendable if every matching of size k in G can be e...
Let G be a graph with vertex set V (G). Let n and k be non-negative integers such that n+ 2k ≤ |V (G...
AbstractA graph G is said to be n-factor-critical if G−T has a perfect matching for each T⊂V(G) with...
AbstractA graph G of order p is k-factor-critical,where p and k are positive integers with the same ...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
On the one hand a 1-matching or simply a matching of a graph G=(V,E) is a set of pairwise non incide...
AMS Subject Classication: 05C70 Abstract. Let n be a non-negative integer. A graph G is said to be n...
AbstractProposing them as a general framework, Liu and Yu (2001) [6] introduced (n,k,d)-graphs to un...
AbstractA graph G is said to be n-factor-critical if G−T has a perfect matching for each T⊂V(G) with...
AbstractA graph G of even order is said to be k-extendable if every matching of size k in G can be e...
AbstractA graph G of order p is k-factor-critical,where p and k are positive integers with the same ...
In Section 1, we recall the historical sketch of matching and factor theory of graphs, and also intr...
AbstractGallai and Edmonds independently obtained a canonical decomposition of graphs in terms of th...
Let G be a simple connected graph on 2n vertices with a perfect matching. For 1 ≤ k ≤ n - 1, G is sa...
summary:Let $GP(n,k)$ be a generalized Petersen graph with $(n,k)=1$, $ n>k\geq4.$ Then every pair o...
AbstractA graph G of even order is said to be k-extendable if every matching of size k in G can be e...
Let G be a graph with vertex set V (G). Let n and k be non-negative integers such that n+ 2k ≤ |V (G...
AbstractA graph G is said to be n-factor-critical if G−T has a perfect matching for each T⊂V(G) with...
AbstractA graph G of order p is k-factor-critical,where p and k are positive integers with the same ...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
On the one hand a 1-matching or simply a matching of a graph G=(V,E) is a set of pairwise non incide...
AMS Subject Classication: 05C70 Abstract. Let n be a non-negative integer. A graph G is said to be n...
AbstractProposing them as a general framework, Liu and Yu (2001) [6] introduced (n,k,d)-graphs to un...
AbstractA graph G is said to be n-factor-critical if G−T has a perfect matching for each T⊂V(G) with...
AbstractA graph G of even order is said to be k-extendable if every matching of size k in G can be e...
AbstractA graph G of order p is k-factor-critical,where p and k are positive integers with the same ...
In Section 1, we recall the historical sketch of matching and factor theory of graphs, and also intr...
AbstractGallai and Edmonds independently obtained a canonical decomposition of graphs in terms of th...
Let G be a simple connected graph on 2n vertices with a perfect matching. For 1 ≤ k ≤ n - 1, G is sa...
summary:Let $GP(n,k)$ be a generalized Petersen graph with $(n,k)=1$, $ n>k\geq4.$ Then every pair o...
DOI
Add to ORKG