Minimum number of disjoint linear forests covering a planar graph (Q405685)

From MaRDI portal
Revision as of 00:59, 9 July 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
Minimum number of disjoint linear forests covering a planar graph
scientific article

    Statements

    Minimum number of disjoint linear forests covering a planar graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 September 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    planar graph
    0 references
    linear forest
    0 references
    cycle
    0 references
    covering
    0 references
    0 references