Chromatic numbers of two-distance graphs in Q^2

zbMATH Open1262.05059MaRDI QIDQ4906930FDOQ4906930

Matt Noble

Publication date: 28 February 2013

Recommendations

• The chromatic numbers of some Euclidean distance graphs
• Coloring distance graphs: a few answers and many questions
• Euclidean Distance Graphs on the Rational Points
• Publication:3203045
• Chromatic numbers of integer distance graphs

zbMATH Keywords

chromatic graphEuclidean distance graphcoloring the rationals

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62) Infinite graphs (05C63) Other combinatorial number theory (11B75) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial complexity of geometric structures (52C45)

Cited In (6)

• A note on 2-distance chromatic numbers of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two-colorings of a dense subgroup of \({\mathbb{Q}}^ n\) that forbid many distances
• Distances forbidden by some two-coloring of \(\mathbb{Q}^ 2\)

This page was built for publication: Chromatic numbers of two-distance graphs in \(\mathbb Q^2\)

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