Chromatic numbers of two-distance graphs in Q^2

MaRDI QIDQ4906930zbMATH OpenFDO

Authors Matt Noble

Publication date 28 February 2013

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)

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

Cited in

(9)

• A note on 2-distance chromatic numbers of graphs
• More on the second Babai number and second clique number of \(\mathbb Q^3\)
• Coloring distance graphs: a few answers and many questions
• scientific article; zbMATH DE number 1452726 (Why is no real title available?)
• scientific article; zbMATH DE number 4057518 (Why is no real title available?)
• scientific article; zbMATH DE number 4179399 (Why is no real title available?)
• Two-colorings of a dense subgroup of \({\mathbb{Q}}^ n\) that forbid many distances
• Answer to an isomorphism problem in \(\mathbb{Z}^2\)
• 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)