A small 6-chromatic two-distance graph in the plane
From MaRDI portal
Publication:5132836
zbMATH Open1458.05082arXiv2010.12656MaRDI QIDQ5132836
Publication date: 12 November 2020
Abstract: We give a new, simple proof for the lower bound of the chromatic number of the Euclidean plane with two forbidden distances, based on a graph with only 16 vertices.
Full work available at URL: https://arxiv.org/abs/2010.12656
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items (3)
Coloring distance graphs on the plane ⋮ A 6-chromatic odd-distance graph in the plane ⋮ Title not available (Why is that?)
This page was built for publication: A small 6-chromatic two-distance graph in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5132836)
