Graphs that are randomly packable by some common disconnected graphs (Q1286572)

From MaRDI portal
Revision as of 03:48, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Graphs that are randomly packable by some common disconnected graphs
scientific article

    Statements

    title
    Graphs that are randomly packable by some common disconnected graphs (English)
    0 references
    author
    K. Appert
    0 references
    publication date
    3 May 1999
    0 references
    zbMATH Keywords
    randomly \(F\)-packable
    0 references

    Identifiers

    zbMATH DE Number
    1283836
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1286572&oldid=26119506"
    Powered by MediaWiki