On the dimension to represent a graph by a unit distance graph

DOI10.1007/BF01787703zbMath0728.05053OpenAlexW2092028549WikidataQ57382218 ScholiaQ57382218MaRDI QIDQ804603

Vojtěch Rödl, Hiroshi Maehara

Publication date: 1990

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01787703

zbMATH Keywords

orthogonal representationunit distance graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph theory (05C99)

Related Items (5)

Dot product representations of graphs ⋮ Infinite quantum permutations ⋮ Two notions of unit distance graphs ⋮ On the Computational Complexity of Degenerate Unit Distance Representations of Graphs ⋮ Products of unit distance graphs

Cites Work

• Note on induced subgraphs of the unit distance graph \(E^ n\)
• On the Euclidean dimension of a complete multipartite graph
• On the Shannon capacity of a graph

This page was built for publication: On the dimension to represent a graph by a unit distance graph