AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-connected 4-regular graphs) is AC0-equivalent with the general perfect matching problem for arbitrary graphs
In this note, we strengthen the inapproximation bound of O(log n) for the labeled perfect matching p...
AbstractWe show that the problem of computing the number of perfect matchings in K3,3-free graphs is...
In this paper, we consider the minimum maximal matching problem in some classes of graphs such as re...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
It is known that finding a perfect matching in a general graph is AC0-equivalent to finding a perfe...
It is known that finding a perfect matching in a general graph is AC0-equivalent to finding a perfe...
We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect mat...
We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect mat...
Let H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there exist two...
AbstractLet H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there e...
AbstractTutte's theorem on perfect matchings is considered from the viewpoint of the Marriage Proble...
A matching of a graph is a subset of the edges of that graph, such that no two edges in the matching...
AbstractOn the basis of the observation that a 3-regular graph has a perfect matching if and only if...
AbstractA general criterion is proved for a graph of any cardinality to possess a perfect matching. ...
Matching A matching M of a graph G = (V,E) is a subset of edges with the property that no two edges ...
In this note, we strengthen the inapproximation bound of O(log n) for the labeled perfect matching p...
AbstractWe show that the problem of computing the number of perfect matchings in K3,3-free graphs is...
In this paper, we consider the minimum maximal matching problem in some classes of graphs such as re...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
It is known that finding a perfect matching in a general graph is AC0-equivalent to finding a perfe...
It is known that finding a perfect matching in a general graph is AC0-equivalent to finding a perfe...
We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect mat...
We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect mat...
Let H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there exist two...
AbstractLet H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there e...
AbstractTutte's theorem on perfect matchings is considered from the viewpoint of the Marriage Proble...
A matching of a graph is a subset of the edges of that graph, such that no two edges in the matching...
AbstractOn the basis of the observation that a 3-regular graph has a perfect matching if and only if...
AbstractA general criterion is proved for a graph of any cardinality to possess a perfect matching. ...
Matching A matching M of a graph G = (V,E) is a subset of edges with the property that no two edges ...
In this note, we strengthen the inapproximation bound of O(log n) for the labeled perfect matching p...
AbstractWe show that the problem of computing the number of perfect matchings in K3,3-free graphs is...
In this paper, we consider the minimum maximal matching problem in some classes of graphs such as re...
DOI
Add to ORKG