11 citations · 17 across the 4 of their papers we have counts for
4 papers
Permutations avoiding bipartite partially ordered patterns have a regular insertion encoding
Christian Bean, Émile Nadeau, Jay Pantone +1
We prove that any class of permutations defined by avoiding a partially ordered pattern (POP) with height at most two has a regular insertion encoding and thus has a rational gener…
Enumeration of Permutation Classes and Weighted Labelled Independent Sets
Christian Bean, Émile Nadeau, Henning Ulfarsson
In this paper, we study the staircase encoding of permutations, which maps a permutation to a staircase grid with cells filled with permutations. We consider many cases, where rest…
Leaf realization problem, caterpillar graphs and prefix normal words
Alexandre Blondin Massé, Julien de Carufel, Alain Goupil +3
Given a simple graph with vertices and a natural number , let be the maximum number of leaves that can be realized by an induced subtree of with…
Fully leafed induced subtrees
Alexandre Blondin Massé, Julien de Carufel, Alain Goupil +3
Let be a simple graph on vertices. We consider the problem LIS of deciding whether there exists an induced subtree with exactly vertices and leaves in …