A small 6-chromatic two-distance graph in the plane

MaRDI QIDQ5132836zbMATH OpenFDO

Authors Jaan Parts

Publication date 12 November 2020

Full work available at URL https://arxiv.org/abs/2010.12656

zbMATH Keywords

chromatic numbercoloring problemEuclidean plane

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

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.

Recommendations

• A 6-chromatic two-distance graph in the plane
• The chromatic number of the plane is at least 5: a new proof
• A 6-chromatic odd-distance graph in the plane
• The chromatic number of the plane is at least 5
• scientific article; zbMATH DE number 7274124

Cited in

(11)

• The chromatic number of the plane is at least 5: a new proof
• Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
• The chromatic number of the plane is at least 5 -- a human-veriviable proof
• The Hadwiger-Nelson problem with two forbidden distances
• On the chromatic number of circular disks and infinite strips in the plane
• Two small 6-chromatic unit-distance graphs in \(\mathbb{R}^3\)
• A 6-chromatic odd-distance graph in the plane
• A 6-chromatic two-distance graph in the plane
• scientific article; zbMATH DE number 7274124 (Why is no real title available?)
• Coloring distance graphs on the plane
• On the Chromatic Number of the Plane with Two Forbidden Distances

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)