The odd-distance plane graph
From MaRDI portal
Publication:2391203
DOI10.1007/S00454-009-9190-2zbMATH Open1200.05059OpenAlexW2068821766MaRDI QIDQ2391203FDOQ2391203
Authors: Hayri Ardal, Ján Maňuch, Moshe Rosenfeld, S. Shelah, Ladislav Stacho
Publication date: 24 July 2009
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9190-2
Recommendations
Cites Work
- Research Problems in Discrete Geometry
- On Sets of Distances of n Points
- Title not available (Why is that?)
- Are There n + 2 Points in E n With Odd Integral Distances?
- Title not available (Why is that?)
- Distances realized by sets covering the plane
- Title not available (Why is that?)
- The maximum number of odd integral distances between points in the plane
- Every graph is an integral distance graph in the plane
- Title not available (Why is that?)
Cited In (14)
- The Hadwiger-Nelson problem
- Every 3-colorable graph has a faithful representation in the odd-distance graph
- Odd Wheels Are Not Odd-distance Graphs
- Coloring distance graphs on the plane
- Spectral bounds for the independence ratio and the chromatic number of an operator
- Odd distances in colourings of the plane
- Odd-distance sets and right-equidistant sequences in the maximum and Manhattan metrics
- Odd wheels are not odd-distance graphs
- Chromatic numbers of exact distance graphs
- Odd-distance and right-equidistant sets in the maximum and Manhattan metrics
- The list-chromatic number of infinite graphs
- The list-chromatic number of infinite graphs defined on Euclidean spaces
- Forbidden subgraphs of the odd-distance graph
- The odd-distance graph
This page was built for publication: The odd-distance plane graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391203)