A combinatorial Gray code for a class of objects is a listing that contains each object from the
class exactly once such that any two consecutive objects in the list differ only by asmall …

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 the …

In this paper, we present a new framework that exploits combinatorial optimization for
efficiently generating a large variety of combinatorial objects based on graphs, matroids …

A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint
rectangles, such that no four rectangles meet in a point. In this work we present a versatile …

This paper deals with lattice congruences of the weak order on the symmetric group, and
initiates the investigation of the cover graphs of the corresponding lattice quotients. These …

We present a Hamilton cycle in the k-sided pancake network and four combinatorial
algorithms to traverse the cycle. The network's vertices are coloured permutations π= p 1 p …

In 1993, Savage, Squire, and West described an inductive construction for generating every
acyclic orientation of a chordal graph exactly once, flipping one arc at a time. We provide two …

You provide us with a matroid and an initial base. We say that a subset of the bases"
belongs to us" if we can visit each one via a sequence of base exchanges starting from the …

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

In 1993, Savage, Squire, and West described an inductive construction for generating every
acyclic orientation of a chordal graph exactly once, flipping one arc at a time. We provide two …