\begin{thebibliography}{10}

\bibitem{biane2002parking}
P.~Biane, {Parking functions of types $A$ and $B$}, {\em The Electronic Journal
  of Combinatorics} {\bf 9}(1) (2002), N7.

\bibitem{chapoton}
F.~Chapoton, Les al\`ebres amass\'ees,
  \url{http://irma.math.unistra.fr/~chapoton/clusters.html}.
\newblock Accessed: 2018-08-31.

\bibitem{chapuy2014counting}
G.~Chapuy and C.~Stump, Counting factorizations of {C}oxeter elements into
  products of reflections, {\em Journal of the London Mathematical Society}
  {\bf 90}(3) (2014), 919--939.

\bibitem{deligne1974letter}
P.~Deligne, Letter to {E}. {L}ooijenga.

\bibitem{deutsch2002diagonally}
E.~Deutsch, S.~Fereti{\'c}, and M.~Noy, Diagonally convex directed polyominoes
  and even trees: a bijection and related issues, {\em Discrete mathematics}
  {\bf 256}(3) (2002), 645--654.

\bibitem{deutsch2002statistics}
E.~Deutsch and M.~Noy, Statistics on non-crossing trees, {\em Discrete
  mathematics} {\bf 254}(1-3) (2002), 75--87.

\bibitem{eidswick1989short}
J.~Eidswick, Short factorizations of permutations into transpositions, {\em
  Discrete mathematics} {\bf 73}(3) (1989), 239--243.

\bibitem{goulden2002tree}
I.~Goulden and A.~Yong, Tree-like properties of cycle factorizations, {\em
  Journal of Combinatorial Theory, Series A} {\bf 98}(1) (2002), 106--117.

\bibitem{guo2011cyclic}
A.~Guo, Cyclic sieving phenomenon in non-crossing connected graphs, {\em The
  Electronic Journal of Combinatorics} {\bf 18}(1) (2011), 9.

\bibitem{JiPropp}
C.~{Ji} and J.~{Propp}, Brussels sprouts, noncrossing trees, and parking
  functions, May 2018.
\newblock arXiv:1805.03608.

\bibitem{michel2014case}
J.~Michel, ``{C}ase-free'' derivation for {W}eyl groups of the number of
  reflection factorisations of a {C}oxeter element, 2014.
\newblock arXiv:1408.0721.

\bibitem{noy1998enumeration}
M.~Noy, Enumeration of noncrossing trees on a circle, {\em Discrete
  Mathematics} {\bf 180}(1-3) (1998), 301--313.

\bibitem{obaid2013number}
M.~Obaid, K.~Nauman, W.~Al-Shammakh, W.~Fakieh, and C.~Ringel, The number of
  complete exceptional sequences for a {D}ynkin algebra, In {\em Colloquium
  Mathematicae}, Vol. 133, pp.  197--210. Institute of Mathematics Polish
  Academy of Sciences, 2013.

\bibitem{panholzer2002bijections}
A.~Panholzer and H.~Prodinger, Bijections for ternary trees and non-crossing
  trees, {\em Discrete mathematics} {\bf 250}(1-3) (2002), 181--195.

\bibitem{reading2008chains}
N.~Reading, Chains in the noncrossing partition lattice, {\em SIAM Journal on
  Discrete Mathematics} {\bf 22}(3) (2008), 875--886.

\bibitem{reiner2004cyclic}
V.~Reiner, D.~Stanton, and D.~White, The cyclic sieving phenomenon, {\em
  Journal of Combinatorial Theory, Series A} {\bf 108}(1) (2004), 17--50.

\bibitem{stanley1997parking}
R.~P. Stanley, Parking functions and noncrossing partitions, {\em Electron. J.
  Combin} {\bf 4}(2) (1997), R20.

\end{thebibliography}