Another six-coloring of the plane

DOI10.1016/0012-365X(95)00210-NzbMATH Open0865.05040WikidataQ106008566 ScholiaQ106008566MaRDI QIDQ1916136FDOQ1916136

Authors: Ilya Hoffman, Alexander Soifer 

Publication date: 29 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 841592
• A 6-chromatic two-distance graph in the plane
• scientific article; zbMATH DE number 866031

zbMATH Keywords

distancecolouringEuclideancolour

Mathematics Subject Classification ID

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

Cites Work

• Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts
• Title not available (Why is that?)
• A six-coloring of the plane
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• The Hadwiger-Nelson problem
• Title not available (Why is that?)
• What percent of the plane can be properly 5- and 6-colored?
• A 6-chromatic two-distance graph in the plane

This page was built for publication: Another six-coloring of the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916136)