Distance graphs on R^n with 1-norm

DOI10.1007/S10878-007-9053-9MaRDI QIDQ2471053zbMATH OpenOpenAlexFDO

Authors 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

1-normchromatic numbercomponentdegreedistance graphmetric space

Mathematics Subject Classification ID

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

Recommendations

• Euclidean Distance Graphs on the Rational Points
• scientific article; zbMATH DE number 5844107
• Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
• Coloring of n-dimensional distance graphs
• The chromatic numbers of distance graphs

Cites work

• Chromatic number of prime distance graphs
• Colouring prime distance graphs
• Colouring the real line
• Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm
• scientific article; zbMATH DE number 3179708 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• Integral distance graphs
• On the chromatic number of special distance graphs

Cited in

(2)

• Metrization of D_E[0,1] by Hausdorff distance between graphs
• Sequence of maximal distance codes in graphs or other metric spaces

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

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