A characterization in \(\mathbb{Z}^ n\) of finite unit-distance graphs in \(\mathbb{R}^ n\)

DOI10.1006/jctb.1993.1061zbMath0794.05111OpenAlexW1967572669MaRDI QIDQ1322002

Kiran B. Chilakamarri

Publication date: 28 August 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1993.1061

zbMATH Keywords

Euclidean distanceunit-distance graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (1)

Unit-distance graphs, graphs on the integer lattice and a Ramsey type result

This page was built for publication: A characterization in \(\mathbb{Z}^ n\) of finite unit-distance graphs in \(\mathbb{R}^ n\)