Every finite graph is a full subgraph of a rigid graph (Q2550402)

From MaRDI portal
Revision as of 05:34, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Every finite graph is a full subgraph of a rigid graph
scientific article

    Statements

    Every finite graph is a full subgraph of a rigid graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1971
    0 references

    Identifiers