1. Alon, N.: On the edge-expansion of graphs, Combinatorics. Probab. Comput. 11, 1–10 (1993)
2. Bahls, P.: http://facstaff.unca.edu/pbahls/talks/WGC.pdf
3. Bellman, R.: Dynamic programming and “difficult crossing” puzzles. Math. Mag. 35 (1), 27–29 (1962)
4. Borndörfer, R., Grötschel, M., Löbel, A.: Alcuin’s transportation problems and integer programming. Konrad-Zuse-Zentrum für Informationstechnik, Berlin (1995). Preprint SC-95-27
5. Csorba, P., Hurkens, C.A.J., Woeginger, G.J.: The Alcuin number of a graph, Proc. ESA2007. LNCS 5193, 320–331 (2008)