Isomorphisms of unit distance graphs of layers
From MaRDI portal
Cites work
- -colorings of strips
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- Annulus graphs in \(\mathbb{R}^d\)
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring distance graphs and graphs of diameters
- Coloring unit-distance strips using SAT
- scientific article; zbMATH DE number 5619577 (Why is no real title available?)
- scientific article; zbMATH DE number 3339101 (Why is no real title available?)
- Mappings of preserving \(n\)-distance one in \(n\)-normed spaces
- On \(n\)-norm preservers and the Aleksandrov conservative \(n\)-distance problem
- On distance graphs in rational spaces
- On Isometries of Euclidean Spaces
- On mappings preserving the distance 1 only in a finite number of directions
- On the chromatic number of a space
- On the chromatic number of an infinitesimal plane layer
- On the chromatic number of circular disks and infinite strips in the plane
- On the chromatic number of slices without monochromatic unit arithmetic progressions
- On the chromatic number of subsets of the Euclidean plane
- Tearing a strip off the plane
- The realization of distances within sets in Euclidean space
- Thin strip graphs
- Turán-type results for distance graphs in an infinitesimal plane layer
This page was built for publication: Isomorphisms of unit distance graphs of layers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7317155)
