Every graph is an integral distance graph in the plane (Q1374191): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1975153673 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Integral distances / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Integral distances / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Are There n + 2 Points in E n With Odd Integral Distances? / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4039245 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Problems, problems, problems / rank | |||
Normal rank | |||
Revision as of 19:22, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every graph is an integral distance graph in the plane |
scientific article |
Statements
Every graph is an integral distance graph in the plane (English)
0 references
12 March 1998
0 references
For a finite subset of the plane the pairs of points for which their euclidean distance is an integer defines the corresponding integral distance graph. It is shown that every finite simple graph may be represented in such a way.
0 references
euclidean plane
0 references
integral distance graph oscillators
0 references
