AbstractA graph G is n-extendable if it is connected, contains a set of n independent edges and every set of n independent edges extends to (i.e. is a subset of) a perfect matching. Combining the results of this and previous papers we answer the question of 2-extendability for all the generalized Petersen graphs G(n, k) with k⩽7 as well as for all G(n, k) with n⩾3k + 5
AbstractSome sufficient conditions for the 2-extendability of k-connected k-regular (k⩾3) planar gra...
AbstractA graph G with at least 2n+2 vertices is said to be n-extendable if every matching of size n...
AbstractWe give two recursive theorems on n-extendible graphs. A graph G is said to be (k, n)-extend...
AbstractA graph G is n-extendable if it is connected, contains a set of n independent edges and ever...
AbstractA graph is said to be 2-extendable if any two edges which do not have a common vertex are co...
AbstractA graph G is said to be n-extendable if it is connected, has a set of n independent lines an...
summary:Let $GP(n,k)$ be a generalized Petersen graph with $(n,k)=1$, $ n>k\geq4.$ Then every pair o...
AbstractIt is proved that every connected strongly regular graph (v(G),k,α,β) with even order is 2-e...
AbstractLet G be a connected graph with p vertices and n a positive integer with 1 ⩽ n ⩽ (p/2) − 1. ...
AbstractA graph G is said to be n-extendable if it is connected, has a set of n independent lines an...
AbstractLet G be a connected graph with p points having a perfect matching and suppose n is a positi...
AbstractA cyclically m-edge-connected n-connected k-regular graph is called an (m.n.k) graph. It is ...
AbstractLet G be a simple connected graph on 2n vertices with perfect matching. For a given positive...
summary:Let $GP(n,k)$ be a generalized Petersen graph with $(n,k)=1$, $ n>k\geq4.$ Then every pair o...
summary:Let $GP(n,k)$ be a generalized Petersen graph with $(n,k)=1$, $ n>k\geq4.$ Then every pair o...
AbstractSome sufficient conditions for the 2-extendability of k-connected k-regular (k⩾3) planar gra...
AbstractA graph G with at least 2n+2 vertices is said to be n-extendable if every matching of size n...
AbstractWe give two recursive theorems on n-extendible graphs. A graph G is said to be (k, n)-extend...
AbstractA graph G is n-extendable if it is connected, contains a set of n independent edges and ever...
AbstractA graph is said to be 2-extendable if any two edges which do not have a common vertex are co...
AbstractA graph G is said to be n-extendable if it is connected, has a set of n independent lines an...
summary:Let $GP(n,k)$ be a generalized Petersen graph with $(n,k)=1$, $ n>k\geq4.$ Then every pair o...
AbstractIt is proved that every connected strongly regular graph (v(G),k,α,β) with even order is 2-e...
AbstractLet G be a connected graph with p vertices and n a positive integer with 1 ⩽ n ⩽ (p/2) − 1. ...
AbstractA graph G is said to be n-extendable if it is connected, has a set of n independent lines an...
AbstractLet G be a connected graph with p points having a perfect matching and suppose n is a positi...
AbstractA cyclically m-edge-connected n-connected k-regular graph is called an (m.n.k) graph. It is ...
AbstractLet G be a simple connected graph on 2n vertices with perfect matching. For a given positive...
summary:Let $GP(n,k)$ be a generalized Petersen graph with $(n,k)=1$, $ n>k\geq4.$ Then every pair o...
summary:Let $GP(n,k)$ be a generalized Petersen graph with $(n,k)=1$, $ n>k\geq4.$ Then every pair o...
AbstractSome sufficient conditions for the 2-extendability of k-connected k-regular (k⩾3) planar gra...
AbstractA graph G with at least 2n+2 vertices is said to be n-extendable if every matching of size n...
AbstractWe give two recursive theorems on n-extendible graphs. A graph G is said to be (k, n)-extend...
DOI
Add to ORKG