Distance graphs on \(\mathbb R^n\) with 1-norm

DOI10.1007/s10878-007-9053-9zbMath1131.05038OpenAlexW2487257394MaRDI QIDQ2471053

Jer-Jeong Chen, Gerard Jennhwa Chang

Publication date: 18 February 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9053-9

zbMATH Keywords

metric spacedegreechromatic numberdistance graphcomponent1-norm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
• Colouring the real line
• Colouring prime distance graphs
• On the chromatic number of special distance graphs
• Chromatic number of prime distance graphs
• Integral distance graphs

This page was built for publication: Distance graphs on \(\mathbb R^n\) with 1-norm