AbstractA graph G is said to be equimatchable if every matching in G extends to (i.e., is a subset of) a maximum matching. In this paper, we use the Gallai–Edmonds decomposition theory for matchings to determine the equimatchable members of two important graph classes. We find that there are precisely 23 3-connected planar graphs (i.e., 3-polytopes) which are equimatchable and that there are only two cubic equimatchable graphs
The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a mat...
For a graph G let α(G) and μ(G) denote respectively the cardinality of a maximum stable set and of a...
In connection with Fulkerson's conjecture on cycle covers, Fan and Raspaudproposed a weaker conjectu...
AbstractA graph G is said to be equimatchable if every matching in G extends to (i.e., is a subset o...
In this paper, we give a new characterization of equimatchable graphs that are graphs with all maxim...
In this paper, we study lower bounds on the size of maximal and maximum matchings in 3-connected pla...
AbstractIn this paper, we study lower bounds on the size of maximal and maximum matchings in 3-conne...
AbstractA graph is called equipackable if every maximal packing in it is also maximum. This generali...
We study the computational complexity of several problems connected withfinding a maximal distance-$...
We develop a theory for the existence of perfect matchings in hypergraphs under quite general condit...
A matching is a set of edges without common endpoint. It was recently shown that every 1-planar grap...
The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a mat...
It is known that finding a perfect matching in a general graph is AC0-equivalent to finding a perfe...
AbstractA matching in a graph is a set of edges no two of which share a common vertex. A matching M ...
We show that the problem of deciding whether the edge set of a bipartite graph can be partitioned in...
The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a mat...
For a graph G let α(G) and μ(G) denote respectively the cardinality of a maximum stable set and of a...
In connection with Fulkerson's conjecture on cycle covers, Fan and Raspaudproposed a weaker conjectu...
AbstractA graph G is said to be equimatchable if every matching in G extends to (i.e., is a subset o...
In this paper, we give a new characterization of equimatchable graphs that are graphs with all maxim...
In this paper, we study lower bounds on the size of maximal and maximum matchings in 3-connected pla...
AbstractIn this paper, we study lower bounds on the size of maximal and maximum matchings in 3-conne...
AbstractA graph is called equipackable if every maximal packing in it is also maximum. This generali...
We study the computational complexity of several problems connected withfinding a maximal distance-$...
We develop a theory for the existence of perfect matchings in hypergraphs under quite general condit...
A matching is a set of edges without common endpoint. It was recently shown that every 1-planar grap...
The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a mat...
It is known that finding a perfect matching in a general graph is AC0-equivalent to finding a perfe...
AbstractA matching in a graph is a set of edges no two of which share a common vertex. A matching M ...
We show that the problem of deciding whether the edge set of a bipartite graph can be partitioned in...
The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a mat...
For a graph G let α(G) and μ(G) denote respectively the cardinality of a maximum stable set and of a...
In connection with Fulkerson's conjecture on cycle covers, Fan and Raspaudproposed a weaker conjectu...
DOI
Add to ORKG