Australasian Journal of Combinatorics
In this paper, we consider pattern avoidance in k-ary heaps, where the permutation associated with the heap is found by recording the nodes as they are encountered in a breadth-first search. We enumerate heaps that avoid patterns of length 3 and collections of patterns of length 3, first with binary heaps and then more generally with k-ary heaps.
Levin, D., Pudwell, L., Riehl, M., and Sandberg, A. (2016). Pattern avoidance in k-ary heaps. Australasian Journal of Combinatorics, 64(1), 120-139.