Almost Every Graph can be Covered by Linear Forests (Q4862746)

From MaRDI portal
Revision as of 21:59, 10 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 843714
Language Label Description Also known as
English
Almost Every Graph can be Covered by Linear Forests
scientific article; zbMATH DE number 843714

    Statements

    Almost Every Graph can be Covered by Linear Forests (English)
    0 references
    0 references
    0 references
    12 February 1996
    0 references
    random variable
    0 references
    linear forest
    0 references
    linear arboricity
    0 references
    maximum degree
    0 references
    probabilistic methods
    0 references

    Identifiers