Minimum number of disjoint linear forests covering a planar graph (Q405685): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Jian Liang Wu / rank
 
Normal rank

Revision as of 07:55, 14 February 2024

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
    planar graph
    0 references
    linear forest
    0 references
    cycle
    0 references
    covering
    0 references

    Identifiers