On the Optimality of Coloring with a Lattice

DOI10.1137/S0895480104439589MaRDI QIDQ5317593zbMATH OpenOpenAlexFDO

Authors Yael Ben-Haim, Tuvi Etzion

Publication date 16 September 2005

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480104439589

zbMATH Keywords

Lee spheretristance

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Lattice packing and covering (number-theoretic aspects) (11H31) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• Optimal tristance anticodes in certain graphs
• A 15-colouring of 3-space omitting distance one
• On 2-coloring the integers to forbid a distance and monochromatic translates of a triangle
• The chromatic numbers of distance graphs
• Distance Coloring of the Hexagonal Lattice

Cited in

(4)

• Interleaving schemes on circulant graphs with two offsets
• Multicolor chain avoidance in the Boolean lattice
• Coloring of lattices
• Optimal tristance anticodes in certain graphs

This page was built for publication: On the Optimality of Coloring with a Lattice

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