Every finite graph is a full subgraph of a rigid graph (Q2550402): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q115954248, #quickstatements; #temporary_batch_1706437032065 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q115954248 / rank | |||
Normal rank | |||
Revision as of 11:28, 28 January 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
