👉 In mathematics, a hookman is a type of graph introduced by Jürgen Neumann in 1983. It is a special case of an extension of the concept of a cycle in a graph. A hookman on a directed graph G (also known as a digraph) consists of a set of cycles that are pairwise disjoint and such that each edge connects two vertices in different cycles. These cycles are called hooks. The hook lengths of a graph can be calculated using the
