A finite word poset.
The combinatorics of evolutionary trees---a survey.
A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs.
Antichains in the homomorphism order of graphs
Let and , respectively, denote the partially ordered sets of homomorphism classes of finite undirected and directed graphs, respectively, both ordered by the homomorphism relation. Order theoretic properties of both have been studied extensively, and have interesting connections to familiar graph properties and parameters. In particular, the notion of a duality is closely related to the idea of splitting a maximal antichain. We construct both splitting and non-splitting infinite maximal antichains...
Page 1