Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Coloring Hamming graphs, optimal binary codes, and the 0/1-Borsuk problem in low dimensions
Computational Discrete Mathematics
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Constructing two-weight codes with prescribed groups of automorphisms
Discrete Applied Mathematics
There Are Integral Heptagons, no Three Points on a Line, no Four on a Circle
Discrete & Computational Geometry
Integral point sets in higher dimensional affine spaces over finite fields
Journal of Combinatorial Theory Series A
Hi-index | 0.04 |
There are many papers studying the properties of point sets in the Euclidean space E^m or on integer grids Z^m, with pairwise integral or rational distances. In this article we consider the distances or coordinates of the point sets which instead of being integers are elements of Z/Zn, and study the properties of the resulting combinatorial structures.