#### Filter Results:

#### Publication Year

1984

2008

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

This is an account for the combinatorially minded reader of various categories of directed and undirected graphs, and their analogies with the category of sets. As an application, the endomorphisms of a graph are in this context not only composable, giving a monoid structure, but also have a notion of adjacency, so that the set of en-domorphisms is both a… (More)

We consider patterns of colourings of G-sets where certain forbidden sub-colourings are excluded. An algorithm is developed for the calculation of inventories of patterns with a prescribed stabilizer class.

- ‹
- 1
- ›