AbstractThe structural theory of matchings is used to establish lower bounds on the number of perfect matchings in n-extendable graphs. It is shown that any such graph on p vertices and q edges contains at least ⌈(n+1)!/4[q-p-(n-1)(2Δ-3)+4]⌉ different perfect matchings, where Δ is the maximum degree of a vertex in G
International audienceWe prove that every n-vertex cubic bridgeless graph has at least n/2 perfect m...
Let n be a non-negative integer. A graph G is said to be n-matchable if the subgraph G − S has a per...
AbstractLet G be a connected graph with p vertices and n a positive integer with 1 ⩽ n ⩽ (p/2) − 1. ...
AbstractGallai and Edmonds independently obtained a canonical decomposition of graphs in terms of th...
AbstractLet G be a connected graph with p points having a perfect matching and suppose n is a positi...
On the one hand a 1-matching or simply a matching of a graph G=(V,E) is a set of pairwise non incide...
AbstractGallai and Edmonds independently obtained a canonical decomposition of graphs in terms of th...
Gallai and Edmonds independently obtained a canonical decomposition of graphs in terms of their ma_....
AbstractLet G be a connected graph with p points having a perfect matching and suppose n is a positi...
AbstractMatching extendability is significant in graph theory and its applications. The basic notion...
summary:A graph having a perfect matching is called $r$-extendable if every matching of size $r$ can...
AbstractA graph G is said to be n-extendable if it is connected, has a set of n independent lines an...
summary:A graph having a perfect matching is called $r$-extendable if every matching of size $r$ can...
AbstractA near perfect matching is a matching covering all but one vertex in a graph. Let G be a con...
AbstractA near perfect matching is a matching saturating all but one vertex in a graph. If G is a co...
International audienceWe prove that every n-vertex cubic bridgeless graph has at least n/2 perfect m...
Let n be a non-negative integer. A graph G is said to be n-matchable if the subgraph G − S has a per...
AbstractLet G be a connected graph with p vertices and n a positive integer with 1 ⩽ n ⩽ (p/2) − 1. ...
AbstractGallai and Edmonds independently obtained a canonical decomposition of graphs in terms of th...
AbstractLet G be a connected graph with p points having a perfect matching and suppose n is a positi...
On the one hand a 1-matching or simply a matching of a graph G=(V,E) is a set of pairwise non incide...
AbstractGallai and Edmonds independently obtained a canonical decomposition of graphs in terms of th...
Gallai and Edmonds independently obtained a canonical decomposition of graphs in terms of their ma_....
AbstractLet G be a connected graph with p points having a perfect matching and suppose n is a positi...
AbstractMatching extendability is significant in graph theory and its applications. The basic notion...
summary:A graph having a perfect matching is called $r$-extendable if every matching of size $r$ can...
AbstractA graph G is said to be n-extendable if it is connected, has a set of n independent lines an...
summary:A graph having a perfect matching is called $r$-extendable if every matching of size $r$ can...
AbstractA near perfect matching is a matching covering all but one vertex in a graph. Let G be a con...
AbstractA near perfect matching is a matching saturating all but one vertex in a graph. If G is a co...
International audienceWe prove that every n-vertex cubic bridgeless graph has at least n/2 perfect m...
Let n be a non-negative integer. A graph G is said to be n-matchable if the subgraph G − S has a per...
AbstractLet G be a connected graph with p vertices and n a positive integer with 1 ⩽ n ⩽ (p/2) − 1. ...
DOI
Add to ORKG