Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048)

From MaRDI portal
Revision as of 19:13, 22 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Decomposing a planar graph with girth at least 8 into a forest and a matching
scientific article

    Statements

    Decomposing a planar graph with girth at least 8 into a forest and a matching (English)
    0 references
    0 references
    0 references
    10 May 2011
    0 references

    Identifiers