On the independence number of minimum distance graphs

DOI10.1007/PL00009381zbMath0912.68149MaRDI QIDQ1275658

György Csizmadia

Publication date: 18 May 1999

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

minimum distance graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

On the independence number of Cayley digraphs of rectangular groups ⋮ Harmonic functions of polynomial growth on infinite penny graphs ⋮ Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count ⋮ MAXIMUM AREA INDEPENDENT SETS IN DISK INTERSECTION GRAPHS ⋮ Discrete harmonic functions on infinite penny graphs ⋮ Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs

Cites Work

• Increasing the minimum distance of a set of points
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the independence number of minimum distance graphs