Deterministically isolating a perfect matching in bipartite planar graphs (Q1959397): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978026115 / rank
 
Normal rank

Revision as of 21:40, 19 March 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
    0 references
    0 references
    0 references
    6 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    isolation lemma
    0 references
    deterministic isolation
    0 references
    perfect matching
    0 references
    planar graphs
    0 references
    NC
    0 references
    0 references