Structuring the elementary components of graphs having a perfect internal matching. (Q1874391)

From MaRDI portal
Revision as of 16:53, 5 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Structuring the elementary components of graphs having a perfect internal matching.
scientific article

    Statements

    Structuring the elementary components of graphs having a perfect internal matching. (English)
    0 references
    0 references
    0 references
    25 May 2003
    0 references
    Graph matching
    0 references
    Alternating path
    0 references
    Elementary graph
    0 references
    Canonical partition
    0 references

    Identifiers