AbstractAn algorithm is proposed for the enumeration and display of all 1-factors for a class of graphs with all vertices of degree two or three
AbstractLet k be a positive integer. It is shown that if G is a graph of order 4k with minimum degre...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
The problem of recognizing approximate graph products arises in theoretical biology. This paper pres...
AbstractAn algorithm is proposed for the enumeration and display of all 1-factors for a class of gra...
This paper gives a new and faster algorithm to find a 1-factor in a bipartite ∆-regular graph. The ...
AbstractWe give a necessary and sufficient condition for the existence of a 1-factor in graphs with ...
A 1-factor in an n-vertex graph G is a collection of n/2 vertex-disjoint edges and a 1-factorization...
AbstractRecently Alon and Friedland have shown that graphs which are the union of complete regular b...
In this paper we give a fuller exposition of a property of 1-factors discussed in [1]. The 1-factors...
We show how to find a decomposition of the edge set of the complete graph into regular factors wher...
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 ...
AbstractMader [Arch. Math. 23 (1972), 219–224] determined the minimal number of 1-factors in a 2k-co...
An algorithm for the factorization of an arbitrary graph G is given. We present an algorithm in pseu...
AbstractConditions on the subgraph induced by the vertices of maximum degree of a simple graph G are...
AbstractLet k be a positive integer. It is shown that if G is a graph of order 4k with minimum degre...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
The problem of recognizing approximate graph products arises in theoretical biology. This paper pres...
AbstractAn algorithm is proposed for the enumeration and display of all 1-factors for a class of gra...
This paper gives a new and faster algorithm to find a 1-factor in a bipartite ∆-regular graph. The ...
AbstractWe give a necessary and sufficient condition for the existence of a 1-factor in graphs with ...
A 1-factor in an n-vertex graph G is a collection of n/2 vertex-disjoint edges and a 1-factorization...
AbstractRecently Alon and Friedland have shown that graphs which are the union of complete regular b...
In this paper we give a fuller exposition of a property of 1-factors discussed in [1]. The 1-factors...
We show how to find a decomposition of the edge set of the complete graph into regular factors wher...
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 ...
AbstractMader [Arch. Math. 23 (1972), 219–224] determined the minimal number of 1-factors in a 2k-co...
An algorithm for the factorization of an arbitrary graph G is given. We present an algorithm in pseu...
AbstractConditions on the subgraph induced by the vertices of maximum degree of a simple graph G are...
AbstractLet k be a positive integer. It is shown that if G is a graph of order 4k with minimum degre...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
The problem of recognizing approximate graph products arises in theoretical biology. This paper pres...
DOI
Add to ORKG