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

From MaRDI portal
Revision as of 11:28, 28 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q115954248, #quickstatements; #temporary_batch_1706437032065)
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