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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0095-8956(71)90038-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974819867 / rank
 
Normal rank

Revision as of 18:04, 19 March 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