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

DOI10.1007/BF01787703zbMATH Open0728.05053DBLPjournals/gc/MaeharaR90OpenAlexW2092028549WikidataQ57382218 ScholiaQ57382218MaRDI QIDQ804603FDOQ804603

Authors: H. Maehara, Vojtěch Rödl 

Publication date: 1990

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

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

Recommendations

• On the metric dimension of a graph
• Unit-Distance Graphs in Minkowski metric spaces
• On the dimension of a graph
• \(\varepsilon\)-unit distance graphs
• On the connectivity of unit distance graphs
• Finite \(\epsilon\)-unit distance graphs
• Unit-distance graphs in rational n-spaces
• Two notions of unit distance graphs
• Two notions of unit distance graphs
• scientific article; zbMATH DE number 866045

zbMATH Keywords

orthogonal representationunit distance graph

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• The coordinate representation of a graph and \(n\)-universal graph of radius 1
• On representations of graphs as two-distance sets
• Products of unit distance graphs
• Two notions of unit distance graphs
• Dot product representations of graphs
• Infinite quantum permutations
• On the computational complexity of degenerate unit distance representations of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804603)