The size of a graph is reconstructible from any \(n-2\) cards (Q2411612)

From MaRDI portal
Revision as of 05:58, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The size of a graph is reconstructible from any \(n-2\) cards
scientific article

    Statements

    The size of a graph is reconstructible from any \(n-2\) cards (English)
    0 references
    0 references
    24 October 2017
    0 references
    graph reconstruction
    0 references
    vertex-deleted subgraphs
    0 references
    common cards
    0 references
    size reconstruction
    0 references

    Identifiers