Upper bound on the circular chromatic number of the plane

zbMath1391.05110MaRDI QIDQ1753019

Konstanty Junosza-Szaniawski

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p53

zbMATH Keywords

Hadwiger-Nelson problemcoloring of the planecircular colouring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Coloring distance graphs on the plane

Cites Work

• Fractional and \(j\)-fold coloring of the plane
• \(\varepsilon\)-unit distance graphs
• Circular Coloring the Plane
• Star chromatic number
• On Harnack's theorem for elliptic differential equations
• Circular chromatic number: A survey

This page was built for publication: Upper bound on the circular chromatic number of the plane