Voir la notice de l'article provenant de la source Theory and Applications of Categories website
@article{TAC_2000_7_a7, author = {Jiri Adamek and G. M. Kelly}, title = {${\cal M}${-Completeness} is seldom monadic over graphs}, journal = {Theory and applications of categories}, pages = {171--205}, publisher = {mathdoc}, volume = {7}, year = {2000}, language = {en}, url = {http://geodesic.mathdoc.fr/item/TAC_2000_7_a7/} }
Jiri Adamek; G. M. Kelly. ${\cal M}$-Completeness is seldom monadic over graphs. Theory and applications of categories, Tome 7 (2000), pp. 171-205. http://geodesic.mathdoc.fr/item/TAC_2000_7_a7/