Two product formulas for counting successive vertex orderings

Boon Suan Ho

A vertex ordering of a graph $G$ is a bijection $\pi :\{1,\dots ,|V(G)|\}\to V(G)$. It is successive if the induced subgraph $G[v_{\pi (1)},\dots ,v_{\pi (k)}]$ is connected for each $k$…