Deterministically isolating a perfect matching in bipartite planar graphs (Q1959397): Difference between revisions
From MaRDI portal
Latest revision as of 07:43, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Deterministically isolating a perfect matching in bipartite planar graphs |
scientific article |
Statements
Deterministically isolating a perfect matching in bipartite planar graphs (English)
0 references
6 October 2010
0 references
isolation lemma
0 references
deterministic isolation
0 references
perfect matching
0 references
planar graphs
0 references
NC
0 references
0 references