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

DOI10.1007/BF01831139MaRDI QIDQ1909657zbMATH OpenOpenAlexWikidataFDO

Authors Kiran B. Chilakamarri, Carolyn R. Mahoney

Publication date 6 October 1996

Published in Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/137629

zbMATH Keywords

clique numberinteger latticecoloringseuclidean planeunit distancechromatic number of the planeeuclidean distanceunit-distance graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Erd?s problems and related topics of discrete geometry (52C10)

Recommendations

• scientific article; zbMATH DE number 653246
• A characterization in \(\mathbb{Z}^ n\) of finite unit-distance graphs in \(\mathbb{R}^ n\)
• scientific article; zbMATH DE number 866045

Cites work

• scientific article; zbMATH DE number 3068973 (Why is no real title available?)
• A characterization in \(\mathbb{Z}^ n\) of finite unit-distance graphs in \(\mathbb{R}^ n\)

Cited in

(3)

• scientific article; zbMATH DE number 653246 (Why is no real title available?)
• Two notions of unit distance graphs
• A bound for \(s\)-distance permutation families and explicit Ramsey graphs

This page was built for publication: Unit-distance graphs, graphs on the integer lattice and a Ramsey type result

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