Every finite graph is a full subgraph of a rigid graph (Q2550402): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q115954248, #quickstatements; #temporary_batch_1706437032065 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:34, 3 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
1971
0 references
