Combinatorial generation via permutation languages. IV. Elimination trees

Jean Cardinal, Arturo Merino, Torsten Mütze

An elimination tree for a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $x$ and recursing on the connected components of $G-x$ to produce…