summary:Let $GP(n,k)$ be a generalized Petersen graph with $(n,k)=1$, $ n>k\geq4.$ Then every pair of parallel edges of $GP(n,k)$ is contained in a 1-factor of $GP(n,k)$. This partially answers a question posed by Larry Cammack and Gerald Schrag [Problem 101, Discrete Math. 73(3), 1989, 311-312]
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set in...
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)...
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...
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 n-extendable if it is connected, contains a set of n independent edges and ever...
AbstractA graph G is n-extendable if it is connected, contains a set of n independent edges and ever...
AbstractWe prove the following: (1) Let G be a graph with a 1-factor and let F be an arbitrary 1-fac...
Let G be a graph with vertex set V (G). Let n and k be non-negative integers such that n+ 2k ≤ |V (G...
AbstractWe investigate the maximum number of edges in a graph with a prescribed number of 1-factors....
AbstractIt is proved that every connected strongly regular graph (v(G),k,α,β) with even order is 2-e...
AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one....
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set in...
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set in...
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set in...
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)...
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...
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 n-extendable if it is connected, contains a set of n independent edges and ever...
AbstractA graph G is n-extendable if it is connected, contains a set of n independent edges and ever...
AbstractWe prove the following: (1) Let G be a graph with a 1-factor and let F be an arbitrary 1-fac...
Let G be a graph with vertex set V (G). Let n and k be non-negative integers such that n+ 2k ≤ |V (G...
AbstractWe investigate the maximum number of edges in a graph with a prescribed number of 1-factors....
AbstractIt is proved that every connected strongly regular graph (v(G),k,α,β) with even order is 2-e...
AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one....
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set in...
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set in...
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set in...
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)...
DOI
Add to ORKG