DOIAbstract
AbstractWe give a new proof of Aharoni′s criterion for the existence of perfect matchings in infinite graphs
AbstractWe give a new proof of Aharoni′s criterion for the existence of perfect matchings in infinite graphs
International audienceWe show that every cubic bridgeless graph G has at least 2|V(G)|/3656 perfect ...
Let n be a non-negative integer. A graph G is said to be n-matchable if the subgraph G − S has a per...
SIGLEAvailable from TIB Hannover: RN 4052(91713-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB...
AbstractWe give a new proof of Aharoni′s criterion for the existence of perfect matchings in infinit...
AbstractA general criterion is proved for a graph of any cardinality to possess a perfect matching. ...
AbstractWe survey the existing theory of matchings in infinite graphs and hypergraphs, with special ...
AbstractWe survey the existing theory of matchings in infinite graphs and hypergraphs, with special ...
AbstractProofs are given of theorems of Lovász and Brualdi on the existence in a finite simple graph...
AbstractA general criterion is proved for a graph of any cardinality to possess a perfect matching. ...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
A matching of a graph is a subset of the edges of that graph, such that no two edges in the matching...
We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particul...
With the modern proliferation of real-world networks, the almost quarter-millenium-old subject of gr...
summary:We give a necessary and sufficient condition for the existence of perfect matchings in a pla...
International audienceWe show that every cubic bridgeless graph G has at least 2|V(G)|/3656 perfect ...
International audienceWe show that every cubic bridgeless graph G has at least 2|V(G)|/3656 perfect ...
Let n be a non-negative integer. A graph G is said to be n-matchable if the subgraph G − S has a per...
SIGLEAvailable from TIB Hannover: RN 4052(91713-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB...
AbstractWe give a new proof of Aharoni′s criterion for the existence of perfect matchings in infinit...
AbstractA general criterion is proved for a graph of any cardinality to possess a perfect matching. ...
AbstractWe survey the existing theory of matchings in infinite graphs and hypergraphs, with special ...
AbstractWe survey the existing theory of matchings in infinite graphs and hypergraphs, with special ...
AbstractProofs are given of theorems of Lovász and Brualdi on the existence in a finite simple graph...
AbstractA general criterion is proved for a graph of any cardinality to possess a perfect matching. ...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
A matching of a graph is a subset of the edges of that graph, such that no two edges in the matching...
We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particul...
With the modern proliferation of real-world networks, the almost quarter-millenium-old subject of gr...
summary:We give a necessary and sufficient condition for the existence of perfect matchings in a pla...
International audienceWe show that every cubic bridgeless graph G has at least 2|V(G)|/3656 perfect ...
International audienceWe show that every cubic bridgeless graph G has at least 2|V(G)|/3656 perfect ...
Let n be a non-negative integer. A graph G is said to be n-matchable if the subgraph G − S has a per...
SIGLEAvailable from TIB Hannover: RN 4052(91713-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB...
Add to ORKG