Generating cyclic pivot Gray codes for well-ordered $k$-degenerate graphs in constant amortized time

Lei Dong, Dennis Wong, Bowie Liu +4

A graph $G$ is $k$-degenerate if there exists an ordering $v_1,v_2,\dots ,v_n$ of its vertices such that each vertex $v_i$ has at most $k$ neighbors $v_j$ in $G$ with $j<i$. A…