13 citations · 25 across the 18 of their papers we have counts for
4 papers · 1 filter
Combinatorial generation via permutation languages. V. Acyclic orientations
Jean Cardinal, Hung P. Hoang, Arturo Merino +2
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 provi…
Colouring bottomless rectangles and arborescences
Jean Cardinal, Kolja Knauer, Piotr Micek +3
We study problems related to colouring bottomless rectangles. One of our main results shows that for any positive integers , there is no semi-online algorithm that can -co…
Flip distances between graph orientations
Oswin Aichholzer, Jean Cardinal, Tony Huynh +4
Flip graphs are a ubiquitous class of graphs, which encode relations induced on a set of combinatorial objects by elementary, local changes. Skeletons of associahedra, for instance…
On the Diameter of Tree Associahedra
Jean Cardinal, Stefan Langerman, Pablo Pérez-Lantero
We consider a natural notion of search trees on graphs, which we show is ubiquitous in various areas of discrete mathematics and computer science. Search trees on graphs can be mod…