Add to ORKGAbstractMader [Arch. Math. 23 (1972), 219–224] determined the minimal number of 1-factors in a 2k-co...
AbstractA graph G is called K1,n-free if G has no induced subgraph isomorphic to K1,n. Let n, a, and...
An algorithm is used to obtain simple proofs of these two known relations in the theory of matched g...
In this paper it is shown that if G is a connected graph of order 2n (n \u3e 1) not containing a 1-f...
In this paper it is shown that if G is a connected graph of order 2n (n \u3e 1) not containing a 1-f...
ABSTRACT. In this paper it is shown that if G is a connected graph of order 2n (n> 1) not contain...
AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one....
Mader [Arch. Math. 23 (1972), 219-224] determined the minimal number of 1-factors in a 2k-connected ...
AbstractMader [Arch. Math. 23 (1972), 219–224] determined the minimal number of 1-factors in a 2k-co...
Mader [Arch. Math. 23 (1972), 219-224] determined the minimal number of 1-factors in a 2k-connected ...
AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one....
AbstractThe line graph L(G) of G is that graph whose vertex set corresponds to the edge set of G suc...
AbstractThe line graph L(G) of G is that graph whose vertex set corresponds to the edge set of G suc...
AbstractEvery one-factorization of the complete graph on n vertices contains k one-factors whose uni...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
AbstractMader [Arch. Math. 23 (1972), 219–224] determined the minimal number of 1-factors in a 2k-co...
AbstractA graph G is called K1,n-free if G has no induced subgraph isomorphic to K1,n. Let n, a, and...
An algorithm is used to obtain simple proofs of these two known relations in the theory of matched g...
In this paper it is shown that if G is a connected graph of order 2n (n \u3e 1) not containing a 1-f...
In this paper it is shown that if G is a connected graph of order 2n (n \u3e 1) not containing a 1-f...
ABSTRACT. In this paper it is shown that if G is a connected graph of order 2n (n> 1) not contain...
AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one....
Mader [Arch. Math. 23 (1972), 219-224] determined the minimal number of 1-factors in a 2k-connected ...
AbstractMader [Arch. Math. 23 (1972), 219–224] determined the minimal number of 1-factors in a 2k-co...
Mader [Arch. Math. 23 (1972), 219-224] determined the minimal number of 1-factors in a 2k-connected ...
AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one....
AbstractThe line graph L(G) of G is that graph whose vertex set corresponds to the edge set of G suc...
AbstractThe line graph L(G) of G is that graph whose vertex set corresponds to the edge set of G suc...
AbstractEvery one-factorization of the complete graph on n vertices contains k one-factors whose uni...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
AbstractMader [Arch. Math. 23 (1972), 219–224] determined the minimal number of 1-factors in a 2k-co...
AbstractA graph G is called K1,n-free if G has no induced subgraph isomorphic to K1,n. Let n, a, and...
An algorithm is used to obtain simple proofs of these two known relations in the theory of matched g...