Minimal graphs with respect to geometric distance realizability
From MaRDI portal
Publication:2214306
Recommendations
Cites work
- Are There n + 2 Points in E n With Odd Integral Distances?
- Forbidden subgraphs of the odd-distance graph
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- On computational complexity of length embeddability of graphs
- On the computational complexity of degenerate unit distance representations of graphs
- On the dimension of a graph
- The Mathematical Coloring Book
- The maximum number of odd integral distances between points in the plane
- Two notions of unit distance graphs
Cited in
(7)- Graph minors. XII: Distance on a surface
- Unit ball graphs on geodesic spaces
- Small unit-distance graphs in the plane
- Fast recognition of planar non unit distance graphs
- scientific article; zbMATH DE number 4106878 (Why is no real title available?)
- Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
- scientific article; zbMATH DE number 759636 (Why is no real title available?)
This page was built for publication: Minimal graphs with respect to geometric distance realizability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2214306)