A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs (Q3503547)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs
scientific article

    Statements

    A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs (English)
    0 references
    5 June 2008
    0 references
    Pfaffian graphs
    0 references
    polynomial time algorithms
    0 references
    matching theory
    0 references
    matching covered graphs
    0 references

    Identifiers