Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs (Q3723710)

From MaRDI portal
Revision as of 19:56, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs
scientific article

    Statements

    Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs (English)
    0 references
    0 references
    0 references
    1985
    0 references
    0 references
    Polynomial time algorithms
    0 references
    strictly positive integer sequences
    0 references
    free tree
    0 references
    0 references