First non-trivial upper bound on circular chromatic number of the plane

DOI10.1016/j.endm.2015.06.097zbMath1346.05073arXiv1506.01886OpenAlexW2963320275MaRDI QIDQ322359

Konstanty Junosza-Szaniawski

Publication date: 14 October 2016

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

zbMATH Keywords

coloring of the planecircular coloringNelson-Hadwiger problem

Mathematics Subject Classification ID

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

Cites Work

• \(\varepsilon\)-unit distance graphs
• Circular Coloring the Plane
• Star chromatic number
• Circular chromatic number: A survey

This page was built for publication: First non-trivial upper bound on circular chromatic number of the plane