AbstractSome sufficient conditions for the 2-extendability of k-connected k-regular (k⩾3) planar graphs are given. In particular, it is proved that for k⩾3, a k-connected k-regular planar graph with each cyclic cutset of sufficiently large size is 2-extendable
AbstractA graph G with at least 2n+2 vertices is said to be n-extendable if every matching of size n...
A connected graph Γ is k-extendable for a positive integer k if every matching M of size k can be ex...
AbstractA graph is k-extendable if every independent set of size k is contained in a maximum indepen...
AbstractSome sufficient conditions for the 2-extendability of k-connected k-regular (k⩾3) planar gra...
AbstractIt is proved that every connected strongly regular graph (v(G),k,α,β) with even order is 2-e...
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...
AbstractA graph G is n-extendable if it is connected, contains a set of n independent edges and ever...
AbstractA planar cubic graph is k-extendable, k ≥4, if it can be obtained from the cube by repeatedl...
AbstractThe structure of certain non-2-extendable planar graphs is studied first. In particular, 4-c...
AbstractA graph G is said to be n-extendable if it is connected, has a set of n independent lines an...
Let G be a simple connected graph on 2n vertices with perfect matching. For a given positive integer...
AbstractA graph is said to be 2-extendable if any two edges which do not have a common vertex are co...
AbstractA cyclically m-edge-connected n-connected k-regular graph is called an (m.n.k) graph. It is ...
AbstractIt is proved that every connected strongly regular graph (v(G),k,α,β) with even order is 2-e...
AbstractA graph G with at least 2n+2 vertices is said to be n-extendable if every matching of size n...
A connected graph Γ is k-extendable for a positive integer k if every matching M of size k can be ex...
AbstractA graph is k-extendable if every independent set of size k is contained in a maximum indepen...
AbstractSome sufficient conditions for the 2-extendability of k-connected k-regular (k⩾3) planar gra...
AbstractIt is proved that every connected strongly regular graph (v(G),k,α,β) with even order is 2-e...
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...
AbstractA graph G is n-extendable if it is connected, contains a set of n independent edges and ever...
AbstractA planar cubic graph is k-extendable, k ≥4, if it can be obtained from the cube by repeatedl...
AbstractThe structure of certain non-2-extendable planar graphs is studied first. In particular, 4-c...
AbstractA graph G is said to be n-extendable if it is connected, has a set of n independent lines an...
Let G be a simple connected graph on 2n vertices with perfect matching. For a given positive integer...
AbstractA graph is said to be 2-extendable if any two edges which do not have a common vertex are co...
AbstractA cyclically m-edge-connected n-connected k-regular graph is called an (m.n.k) graph. It is ...
AbstractIt is proved that every connected strongly regular graph (v(G),k,α,β) with even order is 2-e...
AbstractA graph G with at least 2n+2 vertices is said to be n-extendable if every matching of size n...
A connected graph Γ is k-extendable for a positive integer k if every matching M of size k can be ex...
AbstractA graph is k-extendable if every independent set of size k is contained in a maximum indepen...
DOI
Add to ORKG