In this paper, we study lower bounds on the size of maximal and maximum matchings in 3-connected planar graphs and graphs with bounded maximum degree. For each class, we give a lower bound on the size of matchings, and show that the bound is tight for some graph within the class. (C) 2004 Elsevier B.V. All rights reserved
Given a graph $G=(V,E)$, for a vertex set $S\subseteq V$, let $N(S)$ denote the set of vertices in $...
AbstractA matching in a graph is a set of edges no two of which share a common vertex. A matching M ...
AbstractA graph G is said to be equimatchable if every matching in G extends to (i.e., is a subset o...
AbstractIn this paper, we study lower bounds on the size of maximal and maximum matchings in 3-conne...
AbstractLower bounds on the cardinality of the maximum matchings of planar graphs, with a constraint...
AbstractIn this paper, we present algorithms that compute large matchings in planar graphs with fixe...
In this thesis, we study lower bounds on maximum matchings in 1-planar graphs. We expand upon the to...
A matching is a set of edges without common endpoint. It was recently shown that every 1-planar grap...
In this paper we present algorithms for computing large matchings in 3-regular graphs, graphs with m...
In this paper we present algorithms for computing large matchings in 3-regular graphs, graphs with m...
In this paper we present algorithms for computing large matchings in 3-regular graphs, graphs with m...
Abstract. In this paper we study tight lower bounds on the size of a maximum matching in a regular g...
AbstractHenning and Yeo proved a lower bound for the minimum size of a maximum matching in a connect...
In a graph G a matching is a set of edges in which no two edges have a common endpoint. An induced m...
An induced matching M of a graph G is a set of pairwise non-adjacent edges such that their end-verti...
Given a graph $G=(V,E)$, for a vertex set $S\subseteq V$, let $N(S)$ denote the set of vertices in $...
AbstractA matching in a graph is a set of edges no two of which share a common vertex. A matching M ...
AbstractA graph G is said to be equimatchable if every matching in G extends to (i.e., is a subset o...
AbstractIn this paper, we study lower bounds on the size of maximal and maximum matchings in 3-conne...
AbstractLower bounds on the cardinality of the maximum matchings of planar graphs, with a constraint...
AbstractIn this paper, we present algorithms that compute large matchings in planar graphs with fixe...
In this thesis, we study lower bounds on maximum matchings in 1-planar graphs. We expand upon the to...
A matching is a set of edges without common endpoint. It was recently shown that every 1-planar grap...
In this paper we present algorithms for computing large matchings in 3-regular graphs, graphs with m...
In this paper we present algorithms for computing large matchings in 3-regular graphs, graphs with m...
In this paper we present algorithms for computing large matchings in 3-regular graphs, graphs with m...
Abstract. In this paper we study tight lower bounds on the size of a maximum matching in a regular g...
AbstractHenning and Yeo proved a lower bound for the minimum size of a maximum matching in a connect...
In a graph G a matching is a set of edges in which no two edges have a common endpoint. An induced m...
An induced matching M of a graph G is a set of pairwise non-adjacent edges such that their end-verti...
Given a graph $G=(V,E)$, for a vertex set $S\subseteq V$, let $N(S)$ denote the set of vertices in $...
AbstractA matching in a graph is a set of edges no two of which share a common vertex. A matching M ...
AbstractA graph G is said to be equimatchable if every matching in G extends to (i.e., is a subset o...
DOI
Add to ORKG