Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the projections. We are interestedâ€¦ (More)

Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the projections. We are interestedâ€¦ (More)

Given two graphs G1 and G2, one may ask whether or not G2 is a cover of G1. Feng and Kwak [Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73â€“85] provide aâ€¦ (More)