Kahn, A. B. (1962). “Topological sorting of large networks”. Communications of the ACM5 (11): 558–562. doi:10.1145/368996.369025.
Tarjan, Robert E. (1976). “Edge-disjoint spanning trees and depth-first search”. Algorithmica6 (2): 171–185. doi:10.1007/BF00268499.
Vernet, Oswaldo; Markenzon, Lilian (1997). “Hamiltonian problems for reducible flowgraphs”. Proc. 17th International Conference of the Chilean Computer Science Society (SCCC '97). pp. 264–267. doi:10.1109/SCCC.1997.637099.