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

From MaRDI portal
Revision as of 22:38, 6 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60060265, #quickstatements; #temporary_batch_1707252663060)
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
    planar graph
    0 references
    decomposing
    0 references
    girth
    0 references
    forest
    0 references
    matching
    0 references

    Identifiers