#### Filter Results:

#### Publication Year

1992

2010

#### Publication Type

#### Co-author

#### Publication Venue

Learn More

- A. Gustavo González, Andreu Marquez, Javier Fernández Sanz
- Computers & Chemistry
- 1992

- J. Cáceres, D. Garijo, A. González, A. Márquez, M. L. Puertas
- 2010

A set of vertices S is a determining set of a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of G is the minimum cardinality of a determining set of G. This paper studies determining sets of Kneser graphs from a hypergraph perspective. This new technique lets us compute the determining number of a wide… (More)

There are many aperiodic tilings of the plane. The chromatic number of a tiling is the minimum number of colors needed to color the tiles in such a way that every pair of adjacent tiles have distinct colors. In this paper the problem is solved for the last Penrose tiling for which the problem remained unsolved, the Penrose tilings by pentacles (P 1). So we… (More)

- ‹
- 1
- ›