Note on induced subgraphs of the unit distance graph E^ n
From MaRDI portal
Publication:1106853
DOI10.1007/BF02187712zbMATH Open0652.05019MaRDI QIDQ1106853FDOQ1106853
Authors: H. Maehara
Publication date: 1989
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131061
Recommendations
Cites Work
Cited In (14)
- The coordinate representation of a graph and \(n\)-universal graph of radius 1
- Products of unit distance graphs
- Subdividing a graph toward a unit-distance graph in the plane
- Algebraic Distance Graphs and Rigidity
- Two notions of unit distance graphs
- Title not available (Why is that?)
- On the number of edges in induced subgraphs of a special distance graph
- On the maximum number of unit edges in \(K_{m,n}\)
- Simplices with given 2-face areas
- On diversity and stability of unit bases for the Euclidean metric
- Cartesian product partitioning of multi-dimensional reachable state spaces
- On the computational complexity of degenerate unit distance representations of graphs
- On the dimension to represent a graph by a unit distance graph
- Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\)
This page was built for publication: Note on induced subgraphs of the unit distance graph \(E^ n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106853)