Note on induced subgraphs of the unit distance graph \(E^ n\)

DOI10.1007/BF02187712zbMath0652.05019MaRDI QIDQ1106853

Hiroshi Maehara

Publication date: 1989

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131061

zbMATH Keywords

induced subgraphgraph embeddingunit distance graphEuclidean n-spacefinite bipartite graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Related Items (7)

Algebraic Distance Graphs and Rigidity ⋮ CARTESIAN PRODUCT PARTITIONING OF MULTI-DIMENSIONAL REACHABLE STATE SPACES ⋮ Two notions of unit distance graphs ⋮ On the Computational Complexity of Degenerate Unit Distance Representations of Graphs ⋮ Products of unit distance graphs ⋮ Simplices with given 2-face areas ⋮ On the dimension to represent a graph by a unit distance graph

Cites Work

• Unnamed Item
• On the Euclidean dimension of a wheel
• On the Euclidean dimension of a complete multipartite graph
• Helly-type theorems for spheres
• Intersection theorems with geometric consequences
• Geometrical embeddings of graphs
• On the dimension of a graph

This page was built for publication: Note on induced subgraphs of the unit distance graph \(E^ n\)