Label-monotone tree embedding (source code)

= Label-monotone tree embedding
{title2=$T\preceq_Q S$}

For <rooted trees> labelled in a <preorder> $Q$, a label-monotone tree embedding is a <homeomorphic embedding of a rooted tree> whose vertex map satisfies $\ell_T(v)\le_Q\ell_S(h(v))$. The root need not map to the host root. For ordered child lists, require in addition that the map preserve the relative order of distinct branches.