AbstractA matching of a graph is a near-perfect matching if it covers all but one vertex. A connected graph G is said to be factor-critical if G−v has perfect matchings for every vertex v of G. In this paper, the enumeration problems for near-perfect matchings in special factor-critical graphs are solved. From this, the exact values of the number of perfect matchings in special bicritical graphs are obtained
AbstractA vertex subset S of a graph G=(V,E) is a double dominating set for G if |N[v]∩S|≥2 for each...
AbstractA graph G is said to be bicritical if G-u-v has a perfect matching for every choice of a pai...
This thesis is concerned with perfect matchings of graphs and is organized in three parts. In the fi...
AbstractA matching of a graph is a near-perfect matching if it covers all but one vertex. A connecte...
AbstractA graph G is said to be k–γ-critical if the size of any minimum dominating set of vertices i...
AbstractA graph G is said to be n-factor-critical if G−T has a perfect matching for each T⊂V(G) with...
AMS Subject Classication: 05C70 Abstract. Let n be a non-negative integer. A graph G is said to be n...
AbstractA graph G is said to be n-factor-critical if G−T has a perfect matching for each T⊂V(G) with...
Abstract. Let G be a graph on n vertices. A perfect matching of the vertices of G is a collection of...
<p>We develop algorithms to approximately count perfect matchings in bipartite graphs (or permanents...
Abstract. We introduce a class of graphs called compound graphs, which are constructed out of copies...
AbstractThis paper considers some classes of graphs which are easily seen to have many perfect match...
AbstractThe Pfaffian method enumerating perfect matchings of plane graphs was discovered by Kasteley...
A graph $G$ of order $n$ is said to be $k$-factor-critical for integers $1\leq k < n$, if the remova...
A matching of a graph is a subset of the edges of that graph, such that no two edges in the matching...
AbstractA vertex subset S of a graph G=(V,E) is a double dominating set for G if |N[v]∩S|≥2 for each...
AbstractA graph G is said to be bicritical if G-u-v has a perfect matching for every choice of a pai...
This thesis is concerned with perfect matchings of graphs and is organized in three parts. In the fi...
AbstractA matching of a graph is a near-perfect matching if it covers all but one vertex. A connecte...
AbstractA graph G is said to be k–γ-critical if the size of any minimum dominating set of vertices i...
AbstractA graph G is said to be n-factor-critical if G−T has a perfect matching for each T⊂V(G) with...
AMS Subject Classication: 05C70 Abstract. Let n be a non-negative integer. A graph G is said to be n...
AbstractA graph G is said to be n-factor-critical if G−T has a perfect matching for each T⊂V(G) with...
Abstract. Let G be a graph on n vertices. A perfect matching of the vertices of G is a collection of...
<p>We develop algorithms to approximately count perfect matchings in bipartite graphs (or permanents...
Abstract. We introduce a class of graphs called compound graphs, which are constructed out of copies...
AbstractThis paper considers some classes of graphs which are easily seen to have many perfect match...
AbstractThe Pfaffian method enumerating perfect matchings of plane graphs was discovered by Kasteley...
A graph $G$ of order $n$ is said to be $k$-factor-critical for integers $1\leq k < n$, if the remova...
A matching of a graph is a subset of the edges of that graph, such that no two edges in the matching...
AbstractA vertex subset S of a graph G=(V,E) is a double dominating set for G if |N[v]∩S|≥2 for each...
AbstractA graph G is said to be bicritical if G-u-v has a perfect matching for every choice of a pai...
This thesis is concerned with perfect matchings of graphs and is organized in three parts. In the fi...
DOI
Add to ORKG