Chromatic coloring of distance graphs, III
From MaRDI portal
Publication:6113545
DOI10.22199/issn.0717-6279-5689zbMath1522.05092OpenAlexW4319171327MaRDI QIDQ6113545
V. Yegnanarayanan, Unnamed Author
Publication date: 11 July 2023
Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22199/issn.0717-6279-5689
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colouring the real line
- Colouring prime distance graphs
- On a question concerning prime distance graphs
- Distance graphs with finite chromatic number
- The Mathematical Coloring Book
- The chromatic number of the plane is at least 5
- Computing Small Unit-Distance Graphs with Chromatic Number 5
- Circular chromatic number of distance graphs with distance sets of cardinality 3
- Chromatic numbers of integer distance graphs
- Chromatic numbers of Cayley graphs on \(\mathbb Z\) and recurrence
This page was built for publication: Chromatic coloring of distance graphs, III