Lovàsz [1]}
proved that the categories of operations with finite structures
(including the category of finite graphs) are combinatorial.
Various sufficient conditions for combinatoriality are known.
See Pultr [2]}, Isbell [3]},
Dawar, Jakl, and Reggio [4]},
Reggio [5]}, and Fujino and Matsumoto [6]}.
