Every graph is an integral distance graph in the plane (Q1374191): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jcta.1997.2826 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Frank Plastria / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Frank Plastria / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1006/JCTA.1997.2826 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:59, 10 December 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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references