Every finite graph is a full subgraph of a rigid graph (Q2550402): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Pavol Hell / rank
 
Normal rank
Property / author
 
Property / author: Luděk Kučera / rank
 
Normal rank

Revision as of 19:22, 10 February 2024

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