AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one. Furthermore, any graph with a 1-factor has more than one if and only if there is a cycle of even length whose edges are alternately in and not in the given 1-factor. A simple extension of the main result to n-connected graphs is also provided
A 1-factor in an n-vertex graph G is a collection of n/2 vertex-disjoint edges and a 1-factorization...
AbstractF. Bry (J. Combin. Theory Ser. B 34 (1983), 48–57) proved that a locally finite infinite n-c...
An algorithm is used to obtain simple proofs of these two known relations in the theory of matched g...
AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one....
ABSTRACT. In this paper it is shown that if G is a connected graph of order 2n (n> 1) not contain...
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 ...
Mader [Arch. Math. 23 (1972), 219-224] determined the minimal number of 1-factors in a 2k-connected ...
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...
In this paper it is shown that if G is a connected graph of order 2n (n \u3e 1) not containing a 1-f...
AbstractIt is shown that if H is a connected total graph of order 2n then H has at least 4n − 4 1-fa...
AbstractAn algorithm is used to give simple proofs of these two known relations in the theory of mat...
AbstractEvery infinite locally finite graph with exactly one 1-factor is at most 2-connected is show...
AbstractRecently Alon and Friedland have shown that graphs which are the union of complete regular b...
A 1-factor in an n-vertex graph G is a collection of n/2 vertex-disjoint edges and a 1-factorization...
AbstractF. Bry (J. Combin. Theory Ser. B 34 (1983), 48–57) proved that a locally finite infinite n-c...
An algorithm is used to obtain simple proofs of these two known relations in the theory of matched g...
AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one....
ABSTRACT. In this paper it is shown that if G is a connected graph of order 2n (n> 1) not contain...
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 ...
Mader [Arch. Math. 23 (1972), 219-224] determined the minimal number of 1-factors in a 2k-connected ...
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...
In this paper it is shown that if G is a connected graph of order 2n (n \u3e 1) not containing a 1-f...
AbstractIt is shown that if H is a connected total graph of order 2n then H has at least 4n − 4 1-fa...
AbstractAn algorithm is used to give simple proofs of these two known relations in the theory of mat...
AbstractEvery infinite locally finite graph with exactly one 1-factor is at most 2-connected is show...
AbstractRecently Alon and Friedland have shown that graphs which are the union of complete regular b...
A 1-factor in an n-vertex graph G is a collection of n/2 vertex-disjoint edges and a 1-factorization...
AbstractF. Bry (J. Combin. Theory Ser. B 34 (1983), 48–57) proved that a locally finite infinite n-c...
An algorithm is used to obtain simple proofs of these two known relations in the theory of matched g...
DOI
Add to ORKG